Dynamic computational geometry on meshes and hypercubes

DOI10.1007/BF00127827zbMATH Open1215.65036OpenAlexW2884271645MaRDI QIDQ547490FDOQ547490

Authors 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

nearest neighborhypercubeconvex hullparallel algorithmsmeshclosest pairdynamic computational geometrysmallest enclosing rectangle

Mathematics Subject Classification ID

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

Recommendations

• Parallel computational geometry
• Parallel geometric algorithms on a mesh-connected computer
• scientific article; zbMATH DE number 4092772
• scientific article; zbMATH DE number 4170139
• Optimal parallel algorithms for point-set and polygon problems

Cites Work

• scientific article; zbMATH DE number 3160756 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3978974 (Why is no real title available?)
• scientific article; zbMATH DE number 4050999 (Why is no real title available?)
• scientific article; zbMATH DE number 140494 (Why is no real title available?)
• scientific article; zbMATH DE number 3557226 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• A Combinatorial Problem Connected with Differential Equations
• 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
• Dynamic computational geometry on meshes and hypercubes
• Efficient parallel convex hull algorithms
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• Graph Problems on a Mesh-Connected Processor Array
• Hypercube and shuffle-exchange algorithms for image component labeling
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• On a problem of Davenport and Schinzel
• Optimal Three-Layer Channel Routing
• Some dynamic computational geometry problems
• Sorting on a mesh-connected parallel computer
• The ILLIAC IV Computer

Cited In (11)

• Dynamic geometric data structures via shallow cuttings
• Dynamic computational geometry on meshes and hypercubes
• Faster geometric algorithms via dynamic determinant computation
• A nearly optimal deterministic parallel Voronoi diagram algorithm
• Dynamic proximity calculations for situation awareness
• Computing bisectors in a dynamic geometry environment
• Title not available (Why is no real title available?)
• Parallel algorithm for computing points on a computation front hyperplane
• Title not available (Why is no real title available?)
• Common intersections of polygons
• Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers

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

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