scholarly journals Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time

2009 ◽  
Vol 39 (2) ◽  
pp. 703-729 ◽  
Author(s):  
Timothy M. Chan ◽  
Mihai Ptraşcu
Keyword(s):  
Computational Geometry ◽  
Point Location

PLANAR POINT LOCATION REVISITED

1990 ◽  
Vol 01 (01) ◽  
pp. 71-86 ◽  
Author(s):  
FRANCO P. PREPARATA
Keyword(s):  
Computational Geometry ◽  
Query Point ◽  
Point Location ◽  
Dynamic Algorithms ◽  
Planar Point ◽  
Practical Algorithms ◽  
Planar Point Location ◽  
Static Version

Point location is a fundamental primitive in Computational Geometry. In the plane it is stated as follows: Given a subdivision ℛ of the plane and a query point q, determine the region of ℛ containing q. We survey the work that has led to practical algorithms for the static version of the problem, and discuss current research on the corresponding dynamic algorithms.

Computational Geometry Column 24

1994 ◽  
Vol 25 (4) ◽  
pp. 12-14
Author(s):  
Joseph O'Rourke
Keyword(s):  
Computational Geometry

Computational Geometry Column 64

2016 ◽  
Vol 47 (4) ◽  
pp. 44-47
Author(s):  
Adrian Dumitrescu
Keyword(s):  
Computational Geometry

The Computational Geometry Column #4

1988 ◽  
Vol 22 (2) ◽  
pp. 111-112 ◽  
Author(s):  
Joseph O'Rourke
Keyword(s):  
Computational Geometry
Sign in / Sign up

Export Citation Format

Share Document