PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS

DOI10.1142/S0218195903001050zbMath1152.68654MaRDI QIDQ4818540

Harish Devarajan, Julien Basch, L. Zhang, Piotr Indyk

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Unnamed Item
• Unnamed Item
• Higher-dimensional Voronoi diagrams in linear expected time
• Some dynamic computational geometry problems
• Convex hulls of samples from spherically symmetric distributions
• On minimum and maximum spanning trees of linearly moving points
• The upper bound theorem for polytopes: An easy proof of its asymptotic version
• On the convex hull of uniform random points in a simple \(d\)-polytope
• On the convex hull of random points in a polytope
• On the Average Number of Maxima in a Set of Vectors and Applications
• Data Structures for Mobile Data
• Sur L'enveloppe convexe des nuages de points aleatoires dans Rⁿ. I
• The maximum numbers of faces of a convex polytope
• [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: PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS