Witness (Delaunay) graphs (Q551502): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Efficient algorithms for bichromatic separability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motion planning for a convex polygon in a polygonal environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive facility location: the Voronoi game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Witness Rectangle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strength of weak proximity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general approach to dominance in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing proximity trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAXIMIZING A VORONOI REGION: THE CONVEX CASE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability of Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretical conditions for inscribability and Delaunay realizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast detection of polyhedral intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for determining the separation of convex polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the intersection-depth to polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi diagrams and arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Arrangements of Lines and Hyperplanes with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Chvatal's Watchman Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative neighborhood graph for mixed feature variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees that are sphere-of-influence graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On empty triangles determined by points in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for realizing a Delaunay triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi drawings of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rectangle of influence drawability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitions in geometric minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the convex quadrilaterals of point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler proof of a realizability theorem on Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete and Computational Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains / rank
 
Normal rank

Revision as of 07:00, 4 July 2024

scientific article
Language Label Description Also known as
English
Witness (Delaunay) graphs
scientific article

    Statements

    Witness (Delaunay) graphs (English)
    0 references
    0 references
    0 references
    0 references
    20 July 2011
    0 references
    proximity graphs
    0 references
    Delaunay graph
    0 references
    graph drawing
    0 references
    witness graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers