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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Some dynamic computational geometry problems
• Title not available (Why is that?)
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• A Combinatorial Problem Connected with Differential Equations
• The ILLIAC IV Computer
• 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
• Title not available (Why is that?)
• Graph Problems on a Mesh-Connected Processor Array
• Title not available (Why is that?)
• Efficient parallel convex hull algorithms
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• Title not available (Why is that?)
• On a problem of Davenport and Schinzel
• Sorting on a mesh-connected parallel computer
• Title not available (Why is that?)
• Hypercube and shuffle-exchange algorithms for image component labeling
• Dynamic computational geometry on meshes and hypercubes

Cited In (9)

• Dynamic geometric data structures via shallow cuttings
• Dynamic computational geometry on meshes and hypercubes
• 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 that?)
• Title not available (Why is that?)
• 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)