Expected asymptotically optimal planar point location

被引：21

作者：

Iacono, J ^{[1
]}

机构：

[1] Polytech Univ, Dept Comp & Informat Sci, Brooklyn, NY 11201 USA

来源：

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2004年 / 29卷 / 01期

基金：

美国国家科学基金会;

关键词：

point location; distribution-sensitive data structures;

D O I：

10.1016/j.comgeo.2004.03.010

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Given a fixed distribution of point location queries among the triangles in a triangulation of the plane, a data structure is presented that achieves, within constant multiplicative factors, the entropy bound on the expected point location query time. The data structure is a simple variation of Kirkpatrick's classic planar point location structure [D.G. Kirkpatrick, SIAM J. Comput. 12 (1) (1983) 28-35], and has linear construction costs and space requirements. (C) 2004 Elsevier B.V. All rights reserved.

引用

下载

页码：19 / 22

页数：4

共 50 条

[31] OPTIMAL POINT LOCATION IN A MONOTONE SUBDIVISION
EDELSBRUNNER, H
GUIBAS, LJ
STOLFI, J
SIAM JOURNAL ON COMPUTING, 1986, 15 (02) : 317 - 340
[32] ASYMPTOTICALLY OPTIMAL SEQUENTIAL POINT ESTIMATION OF THE MEAN OF AN EXPONENTIAL FAMILY
TAHIR, M
STATISTICA SINICA, 1994, 4 (01) : 353 - 360
[33] Asymptotically Optimal Methods of Early Change-Point Detection
Brodsky, Boris
Darkhovsky, Boris
SEQUENTIAL ANALYSIS-DESIGN METHODS AND APPLICATIONS, 2013, 32 (02): : 158 - 181
[34] External Memory Planar Point Location with Logarithmic Updates
Arge, Lars
Brodal, Gerth Stolting
Rao, S. Srinivasa
PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SGG'08), 2008, : 139 - 147
[35] An Experimental Study of Point Location in General Planar Arrangements
Haran, Idit
Halperin, Dan
PROCEEDINGS OF THE EIGHTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE THIRD WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2006, : 16 - 25
[36] Online point location in planar arrangements and its applications
Har-Peled, S
Sharir, M
DISCRETE & COMPUTATIONAL GEOMETRY, 2001, 26 (01) : 19 - 40
[37] External Memory Planar Point Location with Logarithmic Updates
Lars Arge
Gerth Stølting Brodal
S. Srinivasa Rao
Algorithmica, 2012, 63 : 457 - 475
[38] Demand Point Aggregation for Planar Covering Location Models
H. Emir-Farinas
R. L. Francis
Annals of Operations Research, 2005, 136 : 175 - 192
[39] Online Point Location in Planar Arrangements and Its Applications
S. Har-Peled
M. Sharir
Discrete & Computational Geometry, 2001, 26 : 19 - 40
[40] Planar point location using persistent search trees
Sarnak, Neil
Tarjan, Robert E.
Annals of the New York Academy of Sciences, 1989, 555

← 1 2 3 4 5 →