Exact, robust, and efficient regularized Booleans on general 3D meshes

Hichem Barki, Gaël Guennebaud, Sebti Foufou

Research output: Contribution to journalArticle

Abstract

Computing Boolean operations (Booleans) of 3D polyhedra/meshes is a basic and essential task in many domains, such as computational geometry, computer-aided design, and constructive solid geometry. Besides their utility and importance, Booleans are challenging to compute when dealing with meshes, because of topological changes, geometric degeneracies, etc. Most prior art techniques either suffer from robustness issues, deal with a restricted class of input/output meshes, or provide only approximate results. We overcome these limitations and present an exact and robust approach performing on general meshes, required to be only closed and orientable. Our method is based on a few geometric and topological predicates that allow to handle all input/output cases considered as degenerate in existing solutions, such as voids, non-manifold, disconnected, and unbounded meshes, and to robustly deal with special input configurations. Our experimentation showed that our more general approach is also more robust and more efficient than Maya's implementation (×3), CGAL's robust Nef polyhedra (×5), and recent plane-based approaches. Finally, we also present a complete benchmark intended to validate Boolean algorithms under relevant and challenging scenarios, and we successfully ascertain both our algorithm and implementation with it.

Original languageEnglish (US)
Pages (from-to)1235-1254
Number of pages20
JournalComputers and Mathematics with Applications
Volume70
Issue number6
DOIs
StatePublished - Jan 1 2015

Fingerprint

Mesh
Computational geometry
Computer aided design
Polyhedron
Constructive Solid Geometry
Geometry
Boolean Operation
Output
Computational Geometry
Computer-aided Design
Voids
Predicate
Experimentation
Benchmark
Robustness
Closed
Scenarios
Configuration
Computing

Keywords

  • 3D meshes
  • Boolean operations
  • Computational geometry
  • Robust geometric computation
  • Solid modeling

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

Cite this

Exact, robust, and efficient regularized Booleans on general 3D meshes. / Barki, Hichem; Guennebaud, Gaël; Foufou, Sebti.

In: Computers and Mathematics with Applications, Vol. 70, No. 6, 01.01.2015, p. 1235-1254.

Research output: Contribution to journalArticle

@article{641df12e984d4bc494255a56a93d7077,
title = "Exact, robust, and efficient regularized Booleans on general 3D meshes",
abstract = "Computing Boolean operations (Booleans) of 3D polyhedra/meshes is a basic and essential task in many domains, such as computational geometry, computer-aided design, and constructive solid geometry. Besides their utility and importance, Booleans are challenging to compute when dealing with meshes, because of topological changes, geometric degeneracies, etc. Most prior art techniques either suffer from robustness issues, deal with a restricted class of input/output meshes, or provide only approximate results. We overcome these limitations and present an exact and robust approach performing on general meshes, required to be only closed and orientable. Our method is based on a few geometric and topological predicates that allow to handle all input/output cases considered as degenerate in existing solutions, such as voids, non-manifold, disconnected, and unbounded meshes, and to robustly deal with special input configurations. Our experimentation showed that our more general approach is also more robust and more efficient than Maya's implementation (×3), CGAL's robust Nef polyhedra (×5), and recent plane-based approaches. Finally, we also present a complete benchmark intended to validate Boolean algorithms under relevant and challenging scenarios, and we successfully ascertain both our algorithm and implementation with it.",
keywords = "3D meshes, Boolean operations, Computational geometry, Robust geometric computation, Solid modeling",
author = "Hichem Barki and Ga{\"e}l Guennebaud and Sebti Foufou",
year = "2015",
month = "1",
day = "1",
doi = "10.1016/j.camwa.2015.06.016",
language = "English (US)",
volume = "70",
pages = "1235--1254",
journal = "Computers and Mathematics with Applications",
issn = "0898-1221",
publisher = "Elsevier Limited",
number = "6",

}

TY - JOUR

T1 - Exact, robust, and efficient regularized Booleans on general 3D meshes

AU - Barki, Hichem

AU - Guennebaud, Gaël

AU - Foufou, Sebti

PY - 2015/1/1

Y1 - 2015/1/1

N2 - Computing Boolean operations (Booleans) of 3D polyhedra/meshes is a basic and essential task in many domains, such as computational geometry, computer-aided design, and constructive solid geometry. Besides their utility and importance, Booleans are challenging to compute when dealing with meshes, because of topological changes, geometric degeneracies, etc. Most prior art techniques either suffer from robustness issues, deal with a restricted class of input/output meshes, or provide only approximate results. We overcome these limitations and present an exact and robust approach performing on general meshes, required to be only closed and orientable. Our method is based on a few geometric and topological predicates that allow to handle all input/output cases considered as degenerate in existing solutions, such as voids, non-manifold, disconnected, and unbounded meshes, and to robustly deal with special input configurations. Our experimentation showed that our more general approach is also more robust and more efficient than Maya's implementation (×3), CGAL's robust Nef polyhedra (×5), and recent plane-based approaches. Finally, we also present a complete benchmark intended to validate Boolean algorithms under relevant and challenging scenarios, and we successfully ascertain both our algorithm and implementation with it.

AB - Computing Boolean operations (Booleans) of 3D polyhedra/meshes is a basic and essential task in many domains, such as computational geometry, computer-aided design, and constructive solid geometry. Besides their utility and importance, Booleans are challenging to compute when dealing with meshes, because of topological changes, geometric degeneracies, etc. Most prior art techniques either suffer from robustness issues, deal with a restricted class of input/output meshes, or provide only approximate results. We overcome these limitations and present an exact and robust approach performing on general meshes, required to be only closed and orientable. Our method is based on a few geometric and topological predicates that allow to handle all input/output cases considered as degenerate in existing solutions, such as voids, non-manifold, disconnected, and unbounded meshes, and to robustly deal with special input configurations. Our experimentation showed that our more general approach is also more robust and more efficient than Maya's implementation (×3), CGAL's robust Nef polyhedra (×5), and recent plane-based approaches. Finally, we also present a complete benchmark intended to validate Boolean algorithms under relevant and challenging scenarios, and we successfully ascertain both our algorithm and implementation with it.

KW - 3D meshes

KW - Boolean operations

KW - Computational geometry

KW - Robust geometric computation

KW - Solid modeling

UR - http://www.scopus.com/inward/record.url?scp=84940460254&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84940460254&partnerID=8YFLogxK

U2 - 10.1016/j.camwa.2015.06.016

DO - 10.1016/j.camwa.2015.06.016

M3 - Article

AN - SCOPUS:84940460254

VL - 70

SP - 1235

EP - 1254

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

SN - 0898-1221

IS - 6

ER -