The stochastic walk algorithms for point location in pseudo-triangulations

DOI10.1016/J.ADVENGSOFT.2011.04.006MaRDI QIDQ634299zbMATH OpenOpenAlexFDO

Authors Ivana Kolingerová, Jan Trčka, 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

zbMATH Keywords

numerical examplestriangulationvisibilitypoint locationcollision detectionpseudo-triangulationwalk algorithm

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• On Lawson's oriented walk in random Delaunay triangulations.
• Enumerating pseudo-triangulations in the plane
• A new point-location algorithm and its practical efficiency: comparison with existing algorithms
• Practical distribution-sensitive point location in triangulations
• Minimum weight pseudo-triangulations

Cites work

• scientific article; zbMATH DE number 4062599 (Why is no real title available?)
• scientific article; zbMATH DE number 2079328 (Why is no real title available?)
• scientific article; zbMATH DE number 1786516 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
• A fast algorithm for constructing Delaunay triangulations in the plane
• A note on point location in Delaunay triangulations of random points
• Algorithms and Data Structures
• Computing Dirichlet Tessellations in the Plane
• Convexity minimizes pseudo-triangulations
• Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
• Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
• Intersections with random geometric objects
• KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
• On Lawson's oriented walk in random Delaunay triangulations.
• On constrained minimum pseudotriangulations
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
• Randomized incremental construction of Delaunay and Voronoi diagrams
• Ray shooting in polygons using geodesic triangulations
• Topologically sweeping visibility complexes via pseudotriangulations
• WALKING IN A TRIANGULATION

Cited in

(3)

• Off-centered ``walk-on-spheres (WOS) algorithm
• Improving resource location with locally precomputed partial random walks
• A robust backward search method based on walk-through for point location on a 3D surface mesh

This page was built for publication: The stochastic walk algorithms for point location in pseudo-triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q634299)