Recommendations
Cites work
- scientific article; zbMATH DE number 4016210 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- A combinatorial theorem in plane geometry
- An Efficient Parallel Biconnectivity Algorithm
- An O(logn) parallel connectivity algorithm
- An optimal algorithm for finding minimal enclosing triangles
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- Convex hulls of finite sets of points in two and three dimensions
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- Fast detection of polyhedral intersection
- Finding Extremal Polygons
- Finding the smallest triangles containing a given convex polygon
- Geometric applications of a matrix-searching algorithm
- Maintenance of configurations in the plane
- Minimum area circumscribing polygons
- Parallel computational geometry
- Parallelism in Comparison Problems
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Reporting and counting segment intersections
- Segments, rectangles, contours
- Sorting in \(c \log n\) parallel steps
- The Parallel Evaluation of General Arithmetic Expressions
- The complexity of elementary algebra and geometry
- Triangulation and shape-complexity
- Voronoi diagrams from convex hulls
Cited in
(70)- Designing checkers for programs that run in parallel
- A sublogarithmic convex hull algorithm
- Parallel computation of distance transforms
- Constructing the Voronoi diagram of a set of line segments in parallel
- Parallel algorithms for the segment dragging problem
- Optimal parallel algorithms for point-set and polygon problems
- scientific article; zbMATH DE number 1796953 (Why is no real title available?)
- Parallel Delaunay triangulation for particle finite element methods
- Extremal polygon containment problems
- scientific article; zbMATH DE number 4016210 (Why is no real title available?)
- A nearly optimal deterministic parallel Voronoi diagram algorithm
- A time-optimal parallel algorithm for three-dimensional convex hulls
- Finding a closet visible vertex pair between two polygons
- Optimal parallel quicksort on EREW PRAM
- Optimal randomized parallel algorithms for computational geometry
- Line-segment intersection reporting in parallel
- Parallel fractional cascading on hypercube multiprocessors
- Parallel methods for visibility and shortest-path problems in simple polygons
- Dynamic computational geometry on meshes and hypercubes
- \(O(\log \log n)\)-time integer geometry on the CRCW PRAM
- Data parallel geometric operations on lists
- Parallel computational geometry
- Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
- An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel
- Constructing arrangements optimally in parallel
- An efficient VLSI architecture with applications to geometric problems
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
- On the multisearching problem for hypercubes
- An optimal parallel algorithm for linear programming in the plane
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
- Parallel geometric algorithms for multi-core computers
- scientific article; zbMATH DE number 4050997 (Why is no real title available?)
- Sweep methods for parallel computational geometry
- Geometric algorithms for private-cache chip multiprocessors (extended abstract)
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- Parallel geometric algorithms on a mesh-connected computer
- An O(log n) time parallel algorithm for triangulating a set of points in the plane
- On parallel complexity of planar triangulations
- Constructing the convex hull of a partially sorted set of points
- Parallel algorithms for some functions of two convex polygons
- Robust algorithms for constructing strongly convex hulls in parallel.
- Parallel algorithms for arrangements
- Parallel solutions to geometric problems in the scan model of computation
- Fast randomized parallel methods for planar convex hull construction
- Parallel computational geometry of rectangles
- Parallel construction of subdivision hierarchies
- Computational geometry algorithms for the systolic screen
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems
- AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS
- scientific article; zbMATH DE number 3945343 (Why is no real title available?)
- scientific article; zbMATH DE number 4092772 (Why is no real title available?)
- Recursion and parallel algorithms in geometric modeling problems
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
- A parallel algorithm for computing Voronoi diagram of a set of circles using touching disc and topology matching
- Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems
- New sequential and parallel algorithms for computing the \(\beta\)-spectrum
- Finding the Convex Hull of Discs in Parallel
- Guarding a terrain by two watchtowers
- Parallel strategies for geometric probing
- CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS
- Load-Balancing for Parallel Delaunay Triangulations
- Geometric Streaming Algorithms with a Sorting Primitive
- Optimal parallel algorithms for proximate points, with applications (extended abstract)
- scientific article; zbMATH DE number 4066315 (Why is no real title available?)
- Geometric streaming algorithm with A sorting primitive
- New parallel algorithms for convex hull and triangulation in 3-dimensional space
- AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗
This page was built for publication: Parallel computational geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115600)
