VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments (Q5943290): Difference between revisions

Latest revision as of 09:59, 4 December 2024

scientific article; zbMATH DE number 1642668

Language	Label	Description	Also known as
English	VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments	scientific article; zbMATH DE number 1642668

Statements

instance of

scholarly article

0 references

title

VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments (English)

0 references

author

Martin Held

0 references

published in

Computational Geometry

0 references

publication date

27 September 2001

0 references

zbMATH Keywords

Voronoi diagrams

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

A linear-time algorithm for computing the Voronoi diagram of a convex polygon

0 references

Surface reconstruction by Voronoi filtering

0 references

Efficient exact evaluation of signs of determinants

0 references

RANDOMIZATION YIELDS SIMPLE O(n <font>log</font><sup>⋆</sup> n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS

0 references

Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms

0 references

A sweepline algorithm for Voronoi diagrams

0 references

Q4401010

0 references

Special issue: Implementation of geometric algorithms

0 references

An automatic coarse and fine surface mesh generation scheme based on medial axis transform. I: Algorithms

0 references

On the computational geometry of pocket machining

0 references

Voronoi diagrams and offset curves of curvilinear polygons.

0 references

FIST: fast industrial-strength triangulation of polygons

0 references

Pocket machining based on contour-parallel tool paths generated by means of proximity maps

0 references

Medial Axis Transformation of a Planar Shape

0 references

Generalization of Voronoi Diagrams in the Plane

0 references

Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design

0 references

Shortest path geometric rounding

0 references

IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS

0 references

Q4361347

0 references

Q4134504

0 references

Q4801184

0 references

Topology-oriented implementation -- an approach to robust geometric algorithms

0 references

A straightforward algorithm for computing the medial axis of a simple polygon

0 references

An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments

0 references

Q4401025

0 references

Finding the medial axis of a simple polygon in linear time

0 references

full work available at URL

https://doi.org/10.1016/s0925-7721(01)00003-7

0 references

Identifiers

zbMATH Open document ID

0976.68162

0 references

DOI

10.1016/S0925-7721(01)00003-7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5943290

@@ Property / describes a project that uses @@
+LEDA
@@ Property / describes a project that uses: LEDA / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Triangle
@@ Property / describes a project that uses: Triangle / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Voronoi
@@ Property / describes a project that uses: Voronoi / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for computing the Voronoi diagram of a convex polygon
+Normal rank
@@ Property / cites work @@
+Surface reconstruction by Voronoi filtering
@@ Property / cites work: Surface reconstruction by Voronoi filtering / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient exact evaluation of signs of determinants
+Normal rank
@@ Property / cites work @@
+RANDOMIZATION YIELDS SIMPLE O(n <font>log</font><sup>⋆</sup> n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
+Normal rank
@@ Property / cites work @@
+Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
+Normal rank
@@ Property / cites work @@
+A sweepline algorithm for Voronoi diagrams
@@ Property / cites work: A sweepline algorithm for Voronoi diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Q4401010
@@ Property / cites work: Q4401010 / rank @@
+Normal rank
@@ Property / cites work @@
+Special issue: Implementation of geometric algorithms
+Normal rank
@@ Property / cites work @@
+An automatic coarse and fine surface mesh generation scheme based on medial axis transform. I: Algorithms
+Normal rank
@@ Property / cites work @@
+On the computational geometry of pocket machining
@@ Property / cites work: On the computational geometry of pocket machining / rank @@
+Normal rank
@@ Property / cites work @@
+Voronoi diagrams and offset curves of curvilinear polygons.
+Normal rank
@@ Property / cites work @@
+FIST: fast industrial-strength triangulation of polygons
+Normal rank
@@ Property / cites work @@
+Pocket machining based on contour-parallel tool paths generated by means of proximity maps
+Normal rank
@@ Property / cites work @@
+Medial Axis Transformation of a Planar Shape
@@ Property / cites work: Medial Axis Transformation of a Planar Shape / rank @@
+Normal rank
@@ Property / cites work @@
+Generalization of Voronoi Diagrams in the Plane
@@ Property / cites work: Generalization of Voronoi Diagrams in the Plane / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
+Normal rank
@@ Property / cites work @@
+Shortest path geometric rounding
@@ Property / cites work: Shortest path geometric rounding / rank @@
+Normal rank
@@ Property / cites work @@
+IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
+Normal rank
@@ Property / cites work @@
+Q4361347
@@ Property / cites work: Q4361347 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4134504
@@ Property / cites work: Q4134504 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4801184
@@ Property / cites work: Q4801184 / rank @@
+Normal rank
@@ Property / cites work @@
+Topology-oriented implementation -- an approach to robust geometric algorithms
+Normal rank
@@ Property / cites work @@
+A straightforward algorithm for computing the medial axis of a simple polygon
+Normal rank
@@ Property / cites work @@
+An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
+Normal rank
@@ Property / cites work @@
+Q4401025
@@ Property / cites work: Q4401025 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the medial axis of a simple polygon in linear time
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0925-7721(01)00003-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2018168260
@@ Property / OpenAlex ID: W2018168260 / rank @@
+Normal rank