New applications of random sampling in computational geometry
Reads0
Chats0
TLDR
This paper gives several new demonstrations of the usefulness of random sampling techniques in computational geometry by creating a search structure for arrangements of hyperplanes by sampling the hyperplanes and using information from the resulting arrangement to divide and conquer.Abstract:
This paper gives several new demonstrations of the usefulness of random sampling techniques in computational geometry. One new algorithm creates a search structure for arrangements of hyperplanes by sampling the hyperplanes and using information from the resulting arrangement to divide and conquer. This algorithm requiresO(sd+?) expected preprocessing time to build a search structure for an arrangement ofs hyperplanes ind dimensions. The expectation, as with all expected times reported here, is with respect to the random behavior of the algorithm, and holds for any input. Given the data structure, and a query pointp, the cell of the arrangement containingp can be found inO(logs) worst-case time. (The bound holds for any fixed ?>0, with the constant factors dependent ond and ?.) Using point-plane duality, the algorithm may be used for answering halfspace range queries. Another algorithm finds random samples of simplices to determine the separation distance of two polytopes. The algorithm uses expectedO(n[d/2]) time, wheren is the total number of vertices of the two polytopes. This matches previous results [10] for the cased = 3 and extends them. Another algorithm samples points in the plane to determine their orderk Voronoi diagram, and requires expectedO(s1+?k) time fors points. (It is assumed that no four of the points are cocircular.) This sharpens the boundO(sk2 logs) for Lee's algorithm [21], andO(s2 logs+k(s?k) log2s) for Chazelle and Edelsbrunner's algorithm [4]. Finally, random sampling is used to show that any set ofs points inE3 hasO(sk2 log8s/(log logs)6) distinctj-sets withj≤k. (ForS ?Ed, a setS? ?S with |S?| =j is aj-set ofS if there is a half-spaceh+ withS? =S ?h+.) This sharpens with respect tok the previous boundO(sk5) [5]. The proof of the bound given here is an instance of a "probabilistic method" [15].read more
Citations
More filters
Posted Content
Low Rank Matrix Approximation in Linear Time.
TL;DR: This algorithm is the first linear-time algorithm to achieve multiplicative approximation and succeeds with constant probability.
Book ChapterDOI
An output-sensitive approach for the L 1 /L ∞ k-nearest-neighbor Voronoi diagram
TL;DR: A tighter bound is given on the structural complexity of the k-NN Voronoi diagram in the L∞ (equiv. L1) metric, which is shown to be O(min{k(n - k), ( n - k)2}).
Journal ArticleDOI
On lines missing polyhedral sets in 3-space
TL;DR: An algorithm for computing the intersection of two polyhedral terrains in 3-space withn total edges in timeO(n4/3+ε+k1/3n1+klog2n), wherek is the size of the output, and ε>0 is an arbitrary small but fixed constant.
Journal ArticleDOI
Minimizing the error of linear separators on linearly inseparable data
TL;DR: Given linearly inseparable sets R of red points and B of blue points, this work considers several measures of how far they are from being separable and provides algorithms to find linear classifiers that minimize the error under these different measures.
Proceedings ArticleDOI
Dynamic point location in arrangements of hyperplanes
Ketan Mulmuley,Sandeep Sen +1 more
TL;DR: Algorithms for maintaining data structures supporting fast (polylogarithmic) point-location and ray-shooting queries in arrangements of hyperplanes using random bits are presented, which has a versatile quality and is likely to have further applications to other dynamic algorithms.
References
More filters
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Computational geometry. an introduction
TL;DR: This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry.
Book ChapterDOI
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
TL;DR: This chapter reproduces the English translation by B. Seckler of the paper by Vapnik and Chervonenkis in which they gave proofs for the innovative results they had obtained in a draft form in July 1966 and announced in 1968 in their note in Soviet Mathematics Doklady.
Book
Computational Geometry: An Introduction
TL;DR: In this article, the authors present a coherent treatment of computational geometry in the plane, at the graduate textbook level, and point out the way to the solution of the more challenging problems in dimensions higher than two.