Pages that link to "Item:Q1261285"
From MaRDI portal
The following pages link to An efficient algorithm for finding the CSG representation of a simple polygon (Q1261285):
Displaying 9 items.
- Improved bounds for wireless localization (Q970612) (← links)
- Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time (Q1276944) (← links)
- Erased arrangements of linear and convex decompositions of polyhedra (Q1384196) (← links)
- Asymptotic speed-ups in constructive solid geometry (Q1894301) (← links)
- Improved Bounds for Wireless Localization (Q3512449) (← links)
- DIMENSION-INDEPENDENT BSP (2): BOUNDARY-TO-INTERIOR MAPPING (Q4527876) (← links)
- Cartographic line simplication and polygon CSG formulae in O(n log* n) time (Q5096928) (← links)
- COMPUTATIONAL GEOMETRY COLUMN 48 (Q5386748) (← links)
- Boolean representations of manifolds and functions (Q5955587) (← links)
