Volume and complexity bounded simplification of solid model represented by Binary Space Partition

    Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

    Abstract

    We present a volume and complexity bounded solid simplification of models represented by Binary Space Partition (BSP). Depending on the compact and robust representation of a solid model in BSP-tree, the boundary surface of a simplified model is guaranteed to be watertight and self-intersection free. Two techniques are investigated in this paper. The volume bounded convex simplification can collapse parts with small volumes on the model into a simple convex volume enclosing the volumetric cells on the input model. The selection of which region to simplify is based on a volume-difference metric, with the help of which the volume difference between the given model and the simplified one is minimized. Another technique is a plane collapse method which reduces the depth of the BSP-tree. These two techniques are integrated into our solid simplification algorithm to give satisfactory results.

    Original languageEnglish
    Title of host publicationProceedings - 14th ACM Symposium on Solid and Physical Modeling, SPM'10
    Pages177-182
    Number of pages6
    DOIs
    Publication statusPublished - 25 Oct 2010
    Event14th ACM Symposium on Solid and Physical Modeling - Haifa, Israel
    Duration: 1 Sept 20103 Sept 2010

    Publication series

    NameProceedings - 14th ACM Symposium on Solid and Physical Modeling, SPM'10

    Conference

    Conference14th ACM Symposium on Solid and Physical Modeling
    Abbreviated titleSPM'10
    Country/TerritoryIsrael
    CityHaifa
    Period1/09/103/09/10

    Keywords

    • Binary space partition
    • Complexity bounded
    • Simplification
    • Solid model
    • Volume bounded

    Fingerprint

    Dive into the research topics of 'Volume and complexity bounded simplification of solid model represented by Binary Space Partition'. Together they form a unique fingerprint.

    Cite this