Intersections with random geometric objects
From MaRDI portal
Publication:1392845
DOI10.1016/S0925-7721(98)00004-2zbMath0901.68198MaRDI QIDQ1392845
Prosenjit Bose, Luc P. Devroye
Publication date: 2 August 1998
Published in: Computational Geometry (Search for Journal in Brave)
Related Items (5)
Expected time analysis for Delaunay point location ⋮ On the stabbing number of a random Delaunay triangulation ⋮ ON DELETION IN DELAUNAY TRIANGULATIONS ⋮ Computing constrained minimum-width annuli of point sets ⋮ The stochastic walk algorithms for point location in pseudo-triangulations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the length of optimal TSP circuits in sets of bounded diameter
- The expected size of some graphs in computational geometry
- The relative neighbourhood graph of a finite planar set
- Moment inequalities for random variables in computational geometry
- Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
- The shortest path and the shortest road through n points
- Coupled Samples in Simulation
- Multidimensional binary search trees used for associative searching
- INTERSECTIONS OF RANDOM LINE SEGMENTS
- Random tessellations in ℝd
- Partial match retrieval of multidimensional data
- [https://portal.mardi4nfdi.de/wiki/Publication:5331598 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten. II]
- [https://portal.mardi4nfdi.de/wiki/Publication:5728818 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten]
This page was built for publication: Intersections with random geometric objects
