Cartographic line simplication and polygon CSG formulae in O(n log* n) time (Q5096928): 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: J. E. Hershberger / rank
Normal rank
 
Property / author
 
Property / author: J. E. Hershberger / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-63307-3_50 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W53622112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for finding the CSG representation of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS / 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: Sorting jordan sequences in linear time using level-linked search trees / 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: Maintenance of configurations in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:47, 29 July 2024

scientific article; zbMATH DE number 7573278
Language Label Description Also known as
English
Cartographic line simplication and polygon CSG formulae in O(n log* n) time
scientific article; zbMATH DE number 7573278

    Statements

    Cartographic line simplication and polygon CSG formulae in O(n log* n) time (English)
    0 references
    0 references
    0 references
    19 August 2022
    0 references
    convex hull
    0 references
    computational geometry
    0 references
    simple polygon
    0 references
    polygonal line
    0 references
    line simplification
    0 references

    Identifiers