The stochastic walk algorithms for point location in pseudo-triangulations
From MaRDI portal
Publication:634299
DOI10.1016/j.advengsoft.2011.04.006zbMath1221.65065OpenAlexW2032422709MaRDI QIDQ634299
Jan Trčka, Ivana Kolingerová, Borut Žalik
Publication date: 2 August 2011
Published in: Advances in Engineering Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.advengsoft.2011.04.006
triangulationnumerical examplesvisibilitycollision detectionpoint locationpseudo-triangulationwalk algorithm
Cites Work
- Convexity minimizes pseudo-triangulations
- Randomized incremental construction of Delaunay and Voronoi diagrams
- A note on point location in Delaunay triangulations of random points
- Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
- Ray shooting in polygons using geodesic triangulations
- Intersections with random geometric objects
- Topologically sweeping visibility complexes via pseudotriangulations
- WALKING IN A TRIANGULATION
- On Constrained Minimum Pseudotriangulations
- Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- A fast algorithm for constructing Delaunay triangulations in the plane
- Computing Dirichlet Tessellations in the Plane
- Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- Algorithms and Data Structures
- Fundamentals of Computation Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The stochastic walk algorithms for point location in pseudo-triangulations
