GEODESIC-PRESERVING POLYGON SIMPLIFICATION (Q5261017): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Thomas Hackl / rank
Normal rank
 
Property / author
 
Property / author: Matias Korman / rank
Normal rank
 
Property / author
 
Property / author: Thomas Hackl / rank
 
Normal rank
Property / author
 
Property / author: Matias Korman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1309.3858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodesic order types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme point and halving edge search in abstract order types / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum-area hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: The furthest-site geodesic Voronoi diagram / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized Winternitz theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal shortest path queries in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing pairwise disjoint paths with few links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing minimum length paths of a given homotopy class / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Euclidean Shortest Paths in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulations, visibility graph and reflex vertices of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of the convex hull of a simple polyline / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L_ 1\) shortest paths among polygonal obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-link paths revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:43, 10 July 2024

scientific article; zbMATH DE number 6454656
Language Label Description Also known as
English
GEODESIC-PRESERVING POLYGON SIMPLIFICATION
scientific article; zbMATH DE number 6454656

    Statements

    GEODESIC-PRESERVING POLYGON SIMPLIFICATION (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 July 2015
    0 references
    polygon
    0 references
    simple polygon
    0 references
    polygonal domain
    0 references
    geodesic
    0 references
    shortest path
    0 references
    geodesic hull
    0 references
    Voronoi diagram
    0 references

    Identifiers