Sweep methods for parallel computational geometry

DOI10.1007/BF01941685MaRDI QIDQ1907233zbMATH OpenFDO

Authors Yanyan Li

Publication date 7 March 1996

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01941685

zbMATH Keywords

computational geometryparallel plane sweeping

Mathematics Subject Classification ID

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

Recommendations

• Parallel computational geometry
• Parallel solutions to geometric problems in the scan model of computation
• scientific article; zbMATH DE number 1182929
• Optimal randomized parallel algorithms for computational geometry
• Topologically sweeping an arrangement

Cites work

• scientific article; zbMATH DE number 432757 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 4060711 (Why is no real title available?)
• scientific article; zbMATH DE number 4064466 (Why is no real title available?)
• scientific article; zbMATH DE number 4064468 (Why is no real title available?)
• scientific article; zbMATH DE number 3759279 (Why is no real title available?)
• scientific article; zbMATH DE number 177849 (Why is no real title available?)
• scientific article; zbMATH DE number 177852 (Why is no real title available?)
• scientific article; zbMATH DE number 1256697 (Why is no real title available?)
• scientific article; zbMATH DE number 3451445 (Why is no real title available?)
• A simple parallel tree contraction algorithm
• An Efficient Parallel Biconnectivity Algorithm
• An O(logn) parallel connectivity algorithm
• An optimal algorithm for intersecting line segments in the plane
• An optimal contour algorithm for iso-oriented rectangles
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
• Computation of the axial view of a set of isothetic parallelepipeds
• Finding the contour of a union of iso-oriented rectangies
• Finding the intersection of two convex polyhedra
• Fractional cascading. I: A data structuring technique
• Hidden line elimination for isooriented rectangles
• Making data structures persistent
• Optimal algorithms to compute the closure of a set of iso-rectangles
• Parallel Merge Sort
• Parallel Prefix Computation
• Parallel computational geometry
• Parallelism in Comparison Problems
• Routing, merging, and sorting on parallel models of computation
• Searching, Merging, and Sorting in Parallel Computation
• Stabbing line segments
• The Parallel Evaluation of General Arithmetic Expressions
• The contour problem for rectilinear polygons
• Time-and space-optimal contour computation for a set of rectangles

Cited in

(4)

• Locating two obnoxious facilities using the weighted maximin criterion
• scientific article; zbMATH DE number 176571 (Why is no real title available?)
• Parallel solutions to geometric problems in the scan model of computation
• Computing a sweeping-plane in regular (``general) position: A numerical and a symbolic solution

This page was built for publication: Sweep methods for parallel computational geometry

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