Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets (Q967409): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Surface Approximation and Geometric Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal set covers in finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Image Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Image Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4295776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Geometry for Computer Imagery / rank
 
Normal rank

Revision as of 18:27, 2 July 2024

scientific article
Language Label Description Also known as
English
Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets
scientific article

    Statements

    Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets (English)
    0 references
    0 references
    28 April 2010
    0 references
    digital geometry
    0 references
    convex hull
    0 references
    abstract cell complex
    0 references
    abstract polyhedron
    0 references
    surface approximation
    0 references

    Identifiers