Sciweavers

28 search results - page 1 / 6
» Dynamic Point Location in General Subdivisions
Sort
View
62
Voted
SODA
1992
ACM
113views Algorithms» more  SODA 1992»
14 years 10 months ago
Dynamic Point Location in General Subdivisions
Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
14 years 9 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
FOCS
2000
IEEE
15 years 2 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount
83
Voted
WAE
2000
95views Algorithms» more  WAE 2000»
14 years 11 months ago
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
Given a collection C of curves in the plane, the arrangement of C is the subdivision of the plane into vertices, edges and faces induced by the curves in C. Constructing arrangemen...
Iddo Hanniel, Dan Halperin
78
Voted
ECCV
2004
Springer
15 years 11 months ago
MCMC-Based Multiview Reconstruction of Piecewise Smooth Subdivision Curves with a Variable Number of Control Points
We investigate the automated reconstruction of piecewise smooth 3D curves, using subdivision curves as a simple but flexible curve representation. This representation allows taggin...
Michael Kaess, Rafal Zboinski, Frank Dellaert