Fast Exact Booleans for Iterated CSG using Octree-Embedded BSPs

Nehring-Wirxel, Julius; Trettner, Philip; Kobbelt, Leif

doi:10.1016/j.cad.2021.103015

Cited by 17 publications

(14 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A pre-clipping procedure is described to shorten edges appropriately, but no robustness guarantees are given for such a preprocessing itself. Instead of using them as temporary structures, BSPs can be maintained throughout the entire pipeline to implement iterated CSG operations with no intermediate approximations [Nehring-Wirxel et al 2021]. Though guaranteeing robustness and supporting cascading, this method is not suitable for non-CSG operations, and no input defects are tolerated.…”

Section: Binary Space Partitioningmentioning

confidence: 99%

Convex polyhedral meshing for robust solid modeling

Diazzi

Attene

2021

ACM Trans. Graph.

View full text Add to dashboard Cite

We introduce a new technique to create a mesh of convex polyhedra representing the interior volume of a triangulated input surface. Our approach is particularly tolerant to defects in the input, which is allowed to self-intersect, to be non-manifold, disconnected, and to contain surface holes and gaps. We guarantee that the input surface is exactly represented as the union of polygonal facets of the output volume mesh. Thanks to our algorithm, traditionally difficult solid modeling operations such as mesh booleans and Minkowski sums become surprisingly robust and easy to implement, even if the input has defects. Our technique leverages on the recent concept of indirect geometric predicate to provide an unprecedented combination of guaranteed robustness and speed, thus enabling the practical implementation of robust though flexible solid modeling systems. We have extensively tested our method on all the 10000 models of the Thingi10k dataset, and concluded that no existing method provides comparable robustness, precision and performances.

show abstract

Section: Binary Space Partitioningmentioning

confidence: 99%

Convex polyhedral meshing for robust solid modeling

Diazzi

Attene

2021

ACM Trans. Graph.

View full text Add to dashboard Cite

show abstract

“…e algorithm introduces the population adaptive mechanism of particle swarm optimization algorithm. Particles dynamically control the path through interaction and dynamically update the path according to the dynamic detection factor ρ and octree modeling environment information, so as to improve the convergence of the algorithm [13].…”

Section: Shortest Path Selection Algorithm Of Cold Chain Logistics Transportationmentioning

confidence: 99%

“…In formula (13), α, β, δ is the influence factor, S is the nectar content of the nectar source, and N is the number of particles that select the target point in this iterative operation. ω represents the weight of the octree node [14].…”

Section: Dynamic Path Updatementioning

confidence: 99%

Shortest Path Selection Algorithm for Cold Chain Logistics Transportation Based on Improved Artificial Bee Colony

Liu

2021

Scientific Programming

View full text Add to dashboard Cite

Aiming at the problems of low shortest path selection accuracy, longer response time, and poor selection effect in current cold chain logistics transportation methods, a cold chain logistics transportation shortest path selection algorithm based on improved artificial bee colony is proposed. The improved algorithm is used to initialize the food source, reevaluate the fitness value of the food source, generate a new food source, optimize the objective function and food source evaluation strategy, and get an improved artificial bee colony algorithm. Based on the improved artificial bee colony algorithm, the group adaptive mechanism of particle swarm algorithm is introduced to initialize the position and velocity of each particle randomly. Dynamic detection factor and octree algorithm are adopted to dynamically update the path of modeling environment information. According to the information sharing mechanism between individual particles, the group adaptive behavior control is performed. After the maximum number of cycles, the path planning is completed, the shortest path is output, and the shortest path selection of cold chain logistics transportation is realized. The experimental results show that the shortest path selection effect of the cold chain logistics transportation of the proposed algorithm is better, which can effectively improve the shortest path selection accuracy and reduce the shortest path selection time.

show abstract

“…[CK10] performs mesh Booleans by inserting the meshes in a temporary shared octree and only switch to the BSP representation in octree cells that contain intersections. [NWTK21] introduce octree‐embedded BSPs as a solution for the iterated CSG problem. They also use fixed‐width integer arithmetic instead of floating point predicates for increased performance.…”

Section: Related Workmentioning

confidence: 99%

Sampling from Quadric‐Based CSG Surfaces

Trettner

Kobbelt

2021

Computer Graphics Forum

Self Cite

View full text Add to dashboard Cite

Figure 1: Our method takes a CSG object defined by quadric surfaces and computes a set of per-surface low-distortion parametrizations. On these, we perform an adaptive subdivision guided by a conservative distance function (left). Once all CSG surface patches are identified, we can generate point samples on them (middle). Our splat-based rendering guarantees perfect surface reconstruction (right). In this example, 327 000 samples across 80 quadric primitives were generated. For models of this complexity, we can generate about a million surface samples per second per CPU core. Render time is 0.5 ms at 1080p.

show abstract

Fast Exact Booleans for Iterated CSG using Octree-Embedded BSPs

Cited by 17 publications

References 23 publications

Convex polyhedral meshing for robust solid modeling

Convex polyhedral meshing for robust solid modeling

Shortest Path Selection Algorithm for Cold Chain Logistics Transportation Based on Improved Artificial Bee Colony

Sampling from Quadric‐Based CSG Surfaces

Contact Info

Product

Resources

About