Dynamic computational geometry on meshes and hypercubes

DOI10.1007/BF00127827zbMath1215.65036OpenAlexW2884271645MaRDI QIDQ547490

Laurence Boxer, Russ Miller

Publication date: 2 July 2011

Published in: The Journal of Supercomputing (Search for Journal in Brave)

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

zbMATH Keywords

hypercubeconvex hullparallel algorithmsmeshnearest neighborclosest pairdynamic computational geometrysmallest enclosing rectangle

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

Common intersections of polygons ⋮ Dynamic computational geometry on meshes and hypercubes ⋮ A nearly optimal deterministic parallel Voronoi diagram algorithm

Cites Work

• Dynamic computational geometry on meshes and hypercubes
• Some dynamic computational geometry problems
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Almost linear upper bounds on the length of general Davenport-Schinzel sequences
• Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
• Optimal Three-Layer Channel Routing
• Graph Problems on a Mesh-Connected Processor Array
• Efficient parallel convex hull algorithms
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• On a problem of Davenport and Schinzel
• Sorting on a mesh-connected parallel computer
• Hypercube and shuffle-exchange algorithms for image component labeling
• A Combinatorial Problem Connected with Differential Equations
• The ILLIAC IV Computer
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dynamic computational geometry on meshes and hypercubes