The stochastic walk algorithms for point location in pseudo-triangulations

DOI10.1016/J.ADVENGSOFT.2011.04.006zbMATH Open1221.65065OpenAlexW2032422709MaRDI QIDQ634299FDOQ634299

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

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

zbMATH Keywords

numerical examplestriangulationvisibilitypoint locationcollision detectionpseudo-triangulationwalk algorithm

Mathematics Subject Classification ID

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

Cites Work

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

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)