Intersections with random geometric objects

DOI10.1016/S0925-7721(98)00004-2MaRDI QIDQ1392845zbMATH OpenFDO

Authors Prosenjit Bose, Luc Devroye

Publication date 2 August 1998

Published in Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

minimum spanning treeVoronoi diagramGabriel graph

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On the Complexity of Randomly Weighted Voronoi Diagrams
• On the complexity of randomly weighted multiplicative Voronoi diagrams
• Voronoi diagrams of random lines and flats
• On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes

Cites work

• scientific article; zbMATH DE number 4051016 (Why is no real title available?)
• scientific article; zbMATH DE number 1079755 (Why is no real title available?)
• scientific article; zbMATH DE number 3052220 (Why is no real title available?)
• Coupled Samples in Simulation
• Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
• INTERSECTIONS OF RANDOM LINE SEGMENTS
• Moment inequalities for random variables in computational geometry
• Multidimensional binary search trees used for associative searching
• On the length of optimal TSP circuits in sets of bounded diameter
• Partial match retrieval of multidimensional data
• Random tessellations in ℝ^d
• The expected size of some graphs in computational geometry
• The relative neighbourhood graph of a finite planar set
• The shortest path and the shortest road through n points
• �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten
• �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten. II

Cited in

(8)

• Random r-flats meeting a ball
• ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX
• On the stabbing number of a random Delaunay triangulation
• ON DELETION IN DELAUNAY TRIANGULATIONS
• Expected time analysis for Delaunay point location
• The stochastic walk algorithms for point location in pseudo-triangulations
• A random direction algorithm for an intersection problem
• Computing constrained minimum-width annuli of point sets

This page was built for publication: Intersections with random geometric objects

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