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

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

Revision as of 18:48, 3 June 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

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

    Identifiers