Dynamic computational geometry on meshes and hypercubes
From MaRDI portal
Publication:547490
DOI10.1007/BF00127827zbMath1215.65036MaRDI QIDQ547490
Publication date: 2 July 2011
Published in: The Journal of Supercomputing (Search for Journal in Brave)
hypercube; convex hull; parallel algorithms; mesh; nearest neighbor; closest pair; dynamic computational geometry; smallest enclosing rectangle
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Related Items
Dynamic computational geometry on meshes and hypercubes, Common intersections of polygons, A nearly optimal deterministic parallel Voronoi diagram algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
