Sets of lines and cutting out polyhedral objects

DOI10.1016/S0925-7721(02)00131-1zbMath1022.65022MaRDI QIDQ1873156

Jerzy W. Jaromczyk, Mirosław Kowaluk

Publication date: 19 May 2003

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

manufacturingcomputational geometrypolyhedral objectsconnectivity graphdual projectionfree movements of lineshot-wire cuttingpolyhedral shapeskewed projection

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (5)

Approximation algorithms for cutting a convex polyhedron out of a sphere ⋮ Cutting a convex polyhedron out of a sphere ⋮ Snipperclips: cutting tools into desired polygons using themselves ⋮ Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere ⋮ CUTTING OUT POLYGONS WITH LINES AND RAYS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of motion planning and related geometric algorithms
• Stabbing line segments
• Constructing the relative neighborhood graph in 3-dimensional Euclidean space
• Algorithms for bichromatic line-segment problems and polyhedral terrains
• Lower bounds on stabbing lines in 3-space
• Spatial Planning: A Configuration Space Approach

This page was built for publication: Sets of lines and cutting out polyhedral objects