Journal Article10.1007/BF01762120
Parallel computational geometry
318
TL;DR: In this paper, the authors present efficient parallel algorithms for several basic problems in computational geometry: convex hulls, Voronoi diagrams, detecting line segment intersections, triangulating simple polygons, minimizing a circumscribing triangle, and recursive data-structures for three-dimensional queries.
read more
Abstract: We present efficient parallel algorithms for several basic problems in computational geometry: convex hulls, Voronoi diagrams, detecting line segment intersections, triangulating simple polygons, minimizing a circumscribing triangle, and recursive data-structures for three-dimensional queries.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Voronoi diagrams—a survey of a fundamental geometric data structure
TL;DR: The Voronoi diagram as discussed by the authors divides the plane according to the nearest-neighbor points in the plane, and then divides the vertices of the plane into vertices, where vertices correspond to vertices in a plane.
4.7K
Data structures for mobile data (invited talk) (abstract only)
Leonidas J. Guibas
- 01 Aug 2000
TL;DR: Kinetic data structures (KDSs) as discussed by the authors are a formal framework for designing and analyzing sets of assertions to cache about the environment, so that these assertion sets are at once relatively stable and tailored to facilitate or trivialize the computation of the attribute of interest.
300
•Book
Cascading Divide-and-conquer: A Technique for Designing Parallel Algorithms
Mikhail J. Atallah,Richard Cole,Michael T. Goodrich +2 more
- 09 Sep 2015
TL;DR: In this article, the authors present techniques for parallel divide-and-conquer, resulting in improved parallel algorithms for a number of problems including intersection detection, trapezoidal decomposition, and planar point location.
Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values
TL;DR: An O (log log n ) time optimal parallel algorithm is given for the all nearest smaller values problem and it is shown that any optimal CRCW PRAM algorithm for the triangulation problem requires Ω( log log n) time.
140
•Book
Optimal Parallel Pattern Matching in Strings
Uzi Vishkin
- 29 Oct 2017
TL;DR: Given a text of length n and a pattern, this work presents a parallel linear algorithm for finding all occurrences of the pattern in the text in O(n/p) time using any number of p ≤ n/log n processors on a concurrent-read concurrent-write parallel random-access-machine.
138
References
•Book
Computational Geometry: An Introduction
Franco P. Preparata,Michael Ian Shamos +1 more
- 01 Jan 1978
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.
4.5K
Computational geometry.
Michael Ian Shamos
- 01 Jan 1978
TL;DR: The first such result is provided by showing that greedy routing can be made to work on Planar triangulations, and some well known results in geometry are generalized to the topological plane.
3.3K
Closest-point problems
Michael Ian Shamos,Dan Hoey +1 more
- 13 Oct 1975
TL;DR: The purpose of this paper is to introduce a single geometric structure, called the Voronoi diagram, which can be constructed rapidly and contains all of the relevant proximity information in only linear space, and is used to obtain O(N log N) algorithms for most of the problems considered.
1.2K
Quantifier elimination for real closed fields by cylindrical algebraic decomposition
George E. Collins,George E. Collins +1 more
- 01 Jan 1975
TL;DR: In this paper, a quantifier elimination method for the elementary theory of real closed fields is presented. But it does not provide a decision method, which enables one to decide whether any sentence of the theory is true or false, since many important and difficult mathematical problems can be expressed in this theory.
967
The Parallel Evaluation of General Arithmetic Expressions
TL;DR: It is shown that arithmetic expressions with n ≥ 1 variables and constants; operations of addition, multiplication, and division; and any depth of parenthesis nesting can be evaluated in time 4 log 2 + 10(n - 1) using processors which can independently perform arithmetic operations in unit time.