Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
type: Item
instance of: scholarly article
title: Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
zbMATH Open document ID: 0913.68201
DOI: 10.1016/S0925-7721(98)00027-3
published in: Computational Geometry
publication date: 1999-02-02T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1247500
zbMATH Keywords: constructive solid geometry
author: John Hershberger
author: Jack Snoeyink
MaRDI profile type: Publication
cites work: An efficient algorithm for finding the CSG representation of a simple polygon
cites work: COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
cites work: Sorting jordan sequences in linear time using level-linked search trees
cites work: On-line construction of the convex hull of a simple polyline
cites work: Maintenance of configurations in the plane
cites work: Q3992847
cites work: The convergence rate of the sandwich algorithm for approximating convex functions
full work available at URL: s0925-7721(98)00027-3
OpenAlex ID: W2056895622
Recommended article: Cartographic line simplication and polygon CSG formulae in O(n log* n) time
Recommended article: Near optimal line segment queries in simple polygons
Recommended article: An efficient algorithm for finding the CSG representation of a simple polygon
Recommended article: Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
Recommended article: LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
Recommended article: Q5088945
Recommended article: Polyline simplification has cubic complexity
Recommended article: Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Recommended article: LATIN 2004: Theoretical Informatics
Recommended article: Q4302465
description: scientific article; zbMATH DE number 1247500