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 条
  • [41] A STATIC OPTIMALITY TRANSFORMATION WITH APPLICATIONS TO PLANAR POINT LOCATION
    Iacono, John
    Mulzer, Wolfgang
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2012, 22 (04) : 327 - 340
  • [42] External Memory Planar Point Location with Logarithmic Updates
    Arge, Lars
    Brodal, Gerth Stolting
    Rao, S. Srinivasa
    ALGORITHMICA, 2012, 63 (1-2) : 457 - 475
  • [43] Online point location in planar arrangements and its applications
    Har-Peled, S
    Sharir, M
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 57 - 66
  • [44] A Static Optimality Transformation with Applications to Planar Point Location
    Iacono, John
    COMPUTATIONAL GEOMETRY (SCG 11), 2011, : 21 - 26
  • [45] PARALLEL TRANSITIVE CLOSURE AND POINT LOCATION IN PLANAR STRUCTURES
    TAMASSIA, R
    VITTER, JS
    SIAM JOURNAL ON COMPUTING, 1991, 20 (04) : 708 - 725
  • [46] Demand point aggregation for planar covering location models
    Emir-Farinas, H
    Francis, RL
    ANNALS OF OPERATIONS RESEARCH, 2005, 136 (01) : 175 - 192
  • [47] AN INCREMENTAL RECONSTRUCTION METHOD FOR DYNAMIC PLANAR POINT LOCATION
    TAMASSIA, R
    INFORMATION PROCESSING LETTERS, 1991, 37 (02) : 79 - 83
  • [48] A static optimality transformation with applications to planar point location
    Department of Computer Science and Engineering, Polytechnic Institute of New York University, 5 MetroTech Center, Brooklyn NY, 11201, United States
    Proc Annu Symp Comput Geom, (21-26):
  • [49] Optimal External Memory Planar Point Enclosure
    Arge, Lars
    Samoladas, Vasilis
    Yi, Ke
    ALGORITHMICA, 2009, 54 (03) : 337 - 352
  • [50] Asymptotically Optimal Power Allocation for Point-to-Point Energy Harvesting Communication Systems
    Zlatanov, Nikola
    Hadzi-Velkov, Zoran
    Schober, Robert
    2013 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2013, : 2502 - 2507
12345