Sciweavers

5 search results - page 1 / 1
» Distribution-sensitive point location in convex subdivisions
Sort
View
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
13 years 6 months ago
Distribution-sensitive point location in convex subdivisions
A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
Sébastien Collette, Vida Dujmovic, John Iac...
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 4 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
13 years 9 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
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
13 years 8 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
SIGGRAPH
2010
ACM
13 years 9 months ago
Physics-inspired topology changes for thin fluid features
We propose a mesh-based surface tracking method for fluid animation that both preserves fine surface details and robustly adjusts the topology of the surface in the presence of ...
Chris Wojtan, Nils Thürey, Markus Gross, Greg Tur...