A fast algorithm for constructing Delaunay triangulations in the plane
Advances in Engineering Software
Randomized multidimensional search trees (extended abstract): dynamic sampling
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
A comparison of sequential Delaunay triangulation algorithms
Proceedings of the eleventh annual symposium on Computational geometry
Computing the visibility graph via pseudo-triangulations
Proceedings of the eleventh annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Pseudo-triangulations: theory and applications
Proceedings of the twelfth annual symposium on Computational geometry
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Improved incremental randomized Delaunay triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Intersections with random geometric object
Computational Geometry: Theory and Applications
Kinetic collision detection for simple polygons
Proceedings of the sixteenth annual symposium on Computational geometry
Allocating vertex π-guards in simple polygons via pseudo-triangulations
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Separation Sensitive Kinetic Separation Structures for Convex Polygons
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
A combinatorial approach to planar non-colliding robot arm motion planning
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
SIAM Journal on Computing
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
SIAM Journal on Computing
On constrained minimum pseudotriangulations
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |
A pseudo-triangulation is a planar subdivision into polygons with three convex vertices, useful for ray shooting, visibility problems and kinetic collision detection. As pseudo-triangulations are quite young, there is a lack of specialized algorithms for them. In this paper, we address the question of location in pseudo-triangulations. We propose two location algorithms based on the so-called stochastic walk and present their experimental results. The class of walk location algorithms is very popular for triangulations, namely in engineering applications, due to simplicity and low memory requirements, in spite of their non-optimality. As far as we know, no walk algorithm specialized on pseudo-triangulations has been developed before.