Sets of lines and cutting out polyhedral objects (Q1873156): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Francisco Pérez Acosta / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Francisco Pérez Acosta / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for bichromatic line-segment problems and polyhedral terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabbing line segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing the relative neighborhood graph in 3-dimensional Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spatial Planning: A Configuration Space Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on stabbing lines in 3-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of motion planning and related geometric algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:35, 5 June 2024

scientific article
Language Label Description Also known as
English
Sets of lines and cutting out polyhedral objects
scientific article

    Statements

    Sets of lines and cutting out polyhedral objects (English)
    0 references
    0 references
    0 references
    19 May 2003
    0 references
    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.
    0 references
    0 references
    polyhedral objects
    0 references
    dual projection
    0 references
    skewed projection
    0 references
    manufacturing
    0 references
    hot-wire cutting
    0 references
    computational geometry
    0 references
    connectivity graph
    0 references
    free movements of lines
    0 references
    polyhedral shape
    0 references