Dynamic well-spaced point sets

DOI10.1145/1810959.1811011MaRDI QIDQ5405896zbMATH OpenOpenAlexFDO

Authors Umut A. Acar, Andrew Cotter, Benoît Hudson, Duru Türkoğlu

Publication date 3 April 2014

Published in Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1810959.1811011

zbMATH Keywords

dynamic stabilitydynamizationmesh generationself-adjusting computationVoronoi diagramswell-spaced point sets

Mathematics Subject Classification ID

Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• Dynamic well-spaced point sets
• scientific article; zbMATH DE number 108318
• A fast algorithm for well-spaced points and approximate Delaunay graphs
• scientific article; zbMATH DE number 1947424
• Fully dynamic geometric spanners

Cited in

(3)

• Dynamic well-spaced point sets
• Dynamic Point Labeling is Strongly PSPACE-Complete
• A fast algorithm for well-spaced points and approximate Delaunay graphs

This page was built for publication: Dynamic well-spaced point sets

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