Pages that link to "Item:Q1277376"
From MaRDI portal
The following pages link to A note on point location in Delaunay triangulations of random points (Q1277376):
Displaying 14 items.
- The stochastic walk algorithms for point location in pseudo-triangulations (Q634299) (← links)
- Kinetic and dynamic Delaunay tetrahedralizations in three dimensions (Q709578) (← links)
- On the stabbing number of a random Delaunay triangulation (Q857055) (← links)
- Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations (Q1286475) (← links)
- Constructing Voronoi diagrams from hollow spheres using conformal geometric algebra (Q1695114) (← links)
- Expected time analysis for Delaunay point location (Q1882851) (← links)
- Boundary layer mesh generation with fast collision detection (Q2172357) (← links)
- Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions (Q2261582) (← links)
- Fast dynamic grid deformation based on Delaunay graph mapping (Q2572208) (← links)
- Practical distribution-sensitive point location in triangulations (Q2637075) (← links)
- Fast range searching with Delaunay triangulations (Q2783173) (← links)
- Efficiently navigating a random Delaunay triangulation (Q2789543) (← links)
- THE DELAUNAY HIERARCHY (Q3021945) (← links)
- Fundamentals of Computation Theory (Q5900799) (← links)