Optimal randomized incremental construction for guaranteed logarithmic planar point location
-
Published:2016-10
Issue:
Volume:58
Page:110-123
-
ISSN:0925-7721
-
Container-title:Computational Geometry
-
language:en
-
Short-container-title:Computational Geometry
Author:
Hemmer Michael,Kleinbort Michal,Halperin Dan
Funder
European Commission
Israel Science Foundation
German–Israeli Foundation
Blavatnik Computer Science Research Fund
Hermann Minkowski–Minerva Center for Geometry at Tel Aviv University
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference23 articles.
1. Entropy-preserving cuttings and space-efficient planar point location;Arya,2001
2. A simple entropy-based algorithm for planar point location;Arya,2001
3. Computational Geometry: Algorithms and Applications;de Berg,2008
4. The Delaunay hierarchy;Devillers;Int. J. Found. Comput. Sci.,2002
5. Multidimensional searching problems;Dobkin;SIAM J. Comput.,1976