Sets of lines and cutting out polyhedral objects

DOI10.1016/S0925-7721(02)00131-1MaRDI QIDQ1873156zbMATH OpenFDO

Authors Jerzy W. Jaromczyk, Mirosław Kowaluk

Publication date 19 May 2003

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0925-7721(02)00131-1

zbMATH Keywords

computational geometryconnectivity graphdual projectionfree movements of lineshot-wire cuttingmanufacturingpolyhedral objectspolyhedral shapeskewed projection

Mathematics Subject Classification ID

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

Review text

The authors study algorithmic problems related to manufacturing applications of hot wire cutters. Such cutters are popular manufacturing tools for cutting expanding polystyrene (styrofoam) with a thin moving heated wire. In particular the question of polyhedral-wise continuity is studied: Can a given object be cut out without disconnecting and then reataching the wire? In an abstract setting this question translates to properties of sets of lines and segments and therefore becomes suitable for computational geometry techniques. On the combinatorial and algorithmic levels the results and methods are related to two problems: (1) Given a set \(F= \{f_1, f_2,\dots, f_k\}\) of polygons and a polygon \(f\) decide if there is a subset of lines in the set of lines not stability \(F\) that cover \(f\). (2) Construct the connectivity graph for free movements of lines that maintain contact with the polyhedral shape.

Recommendations

• Polygons cuttable by a circular saw
• Algorithms and Computation
• CUTTING OUT POLYGONS WITH LINES AND RAYS
• Cutting out polygon collections with a saw
• scientific article; zbMATH DE number 146418

Cites work

• A survey of motion planning and related geometric algorithms
• Algorithms for bichromatic line-segment problems and polyhedral terrains
• Constructing the relative neighborhood graph in 3-dimensional Euclidean space
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 1182925 (Why is no real title available?)
• scientific article; zbMATH DE number 3428118 (Why is no real title available?)
• Lower bounds on stabbing lines in 3-space
• Spatial Planning: A Configuration Space Approach
• Stabbing line segments

Cited in

(8)

• A PTAS for cutting out polygons with lines
• Snipperclips: cutting tools into desired polygons using themselves
• Approximation algorithms for cutting a convex polyhedron out of a sphere
• Cutting a Convex Polyhedron Out of a Sphere
• Approximation algorithms for cutting a convex polyhedron out of a sphere
• scientific article; zbMATH DE number 866038 (Why is no real title available?)
• CUTTING OUT POLYGONS WITH LINES AND RAYS
• Cutting a convex polyhedron out of a sphere

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1873156)