Cartographic line simplication and polygon CSG formulae in O(n ^* n) time
From MaRDI portal
(Redirected from Publication:5096928)
Cartographic line simplication and polygon CSG formulae in \(O(n \log^* n)\) time
Cartographic line simplication and polygon CSG formulae in \(O(n \log^* n)\) time
Recommendations
Cites work
- An efficient algorithm for finding the CSG representation of a simple polygon
- COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Maintenance of configurations in the plane
- On-line construction of the convex hull of a simple polyline
- Sorting jordan sequences in linear time using level-linked search trees
Cited in
(6)- An efficient algorithm for finding the CSG representation of a simple polygon
- Cartographic line simplification and polygon CSG formulae in O(n^* n) time
- A topology construction from line drawings using a uniform plane subdivision technique.
- Polygonal path simplification with angle constraints
- An algorithm for intersections determination among geometric buffers using skip lists
- Polygonal chain approximation: A query based approach
This page was built for publication: Cartographic line simplication and polygon CSG formulae in \(O(n \log^* n)\) time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096928)
