Approximate convex decomposition of polyhedra

Lien, Jyh-Ming; Amato, Nancy M.

doi:10.1145/1186415.1186418

Cited by 47 publications

(70 citation statements)

References 48 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The user could follow the directions to gradually evolve into the final desired model. To partition a mesh into parts, the measure of shape diameter function [22], or SDF for short, and approximate convex decomposition [17], or ACD for short, were used. A quite related work, proposed by Kim et al [14], provides an interface that allows a user to browse similar models by specifying regions of interest, or ROIs for short.…”

Section: Related Workmentioning

confidence: 99%

Integrated model/scene construction through context-based search, data-driven suggestion and component replacement

Chen

Yang

2015

Multimed Tools Appl

View full text Add to dashboard Cite

In recent years, 3D scene construction has become increasingly popular in movies and games. However, it is without doubt that the involved effort is significant, and therefore how to simplify such a process has drawn the attentions from many researchers. More specifically, the construction of a 3D scene consists of two parts: the creation of 3D objects, and their deployment. In general, one possible and popular solution is to reuse previous 3D scene construction results. In this regard, there are least two types of approaches. The first type of approaches places more emphasis on the spatial relationships. In particular, by placing a query box in the current scene and comparing its relationships with other objects under the current scene, a desired object in a previous scene can be retrieved if it shares a similar configuration. However, inappropriate representations of previous spatial relationships may lead to ambiguous or superfluous retrieval results. The second type of approaches focuses on the generation of a single object. A method of such could either start from an initial model and gradually evolve into a more complex/specific one by selecting a similar model in the database, or directly synthesize a new model by a combination of more than one model from the database. This paper proposes a framework that not only integrates the two types of approaches just mentioned, but also unifies the previous two different ways for model construction. In addition, the representation of spatial relationships is further refined so that more desired retrieval results can be obtained, together with a meaningful object class scheme to facilitate the involved interaction for model construction.

show abstract

Section: Related Workmentioning

confidence: 99%

Integrated model/scene construction through context-based search, data-driven suggestion and component replacement

Chen

Yang

2015

Multimed Tools Appl

View full text Add to dashboard Cite

show abstract

“…Besides, there is no need to find the strict convex parts; a certain degree of approximation is enough to satisfy practical processes and can lead to a much more robust representation. Lien and Amato [7], [11] proposed approximate convex decomposition, which decomposes 2D and 3D shapes into approximately convex parts. Liu et al [8] proposed convex shape decomposition to minimize the total length of cuts.…”

Section: Related Workmentioning

confidence: 99%

“…2, instead of requiring each part to be strictly convex, it allows near-convex parts. In [7], [11], Lien and Amato proposed a divide-and-conquer strategy for nearconvex decomposition which partitions the most concave feature in the shape until all the parts satisfy the convexity constraint. A recent method proposed by Liu et al [8] formulated the nearconvex decomposition as a linear programming problem by minimizing the total length of cuts.…”

Section: Introductionmentioning

confidence: 99%

“…First of all, existing methods cannot avoid introducing redundant parts. For example, the greedy algorithm proposed in [7], [11] inevitably results in redundant parts and unstable decomposition. By only optimizing the total cut length, the method of Liu et al [8] generates redundant parts and is not stable either, as illustrated in the last two columns of Fig.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Minimum Near-Convex Shape Decomposition

Ren

Yuan

Liu

2013

IEEE Trans. Pattern Anal. Mach. Intell.

View full text Add to dashboard Cite

Shape decomposition is a fundamental problem for part-based shape representation. We propose the minimum near-convex decomposition (MNCD) to decompose arbitrary shapes into minimum number of "near-convex" parts. The near-convex shape decomposition is formulated as a discrete optimization problem by minimizing the number of nonintersecting cuts. Two perception rules are imposed as constraints into our objective function to improve the visual naturalness of the decomposition. With the degree of near-convexity a user-specified parameter, our decomposition is robust to local distortions and shape deformation. The optimization can be efficiently solved via binary integer linear programming. Both theoretical analysis and experiment results show that our approach outperforms the state-of-the-art results without introducing redundant parts and thus leads to robust shape representation.

show abstract

“…In contrast to the approximate convex decomposition of surfaces often used for collision detection in games [Mamou and Ghorbel 2009], VACD splits the volume enclosed by a mesh into non-overlapping, touching convex regions [Lien and Amato 2007], [Tharp et al 2012]. Our method leverages this property to assign visual geometry uniquely to the convex regions and to perform fast marching on the decomposition to determine the support structure of a partially fractured object.…”

Section: Introductionmentioning

confidence: 99%

Real time dynamic fracture with volumetric approximate convex decompositions

Müller¹,

Chentanez²,

Kim³

2013

ACM Trans. Graph.

View full text Add to dashboard Cite

NVIDIA Figure 1: Destruction of a Roman arena with 1m vertices and 500k faces. The simulation runs at over 30 fps including rigid body simulation, dust simulation and rendering until the end of the sequence where the original mesh is split up into 20k separate pieces. AbstractWe propose a new fast, robust and controllable method to simulate the dynamic destruction of large and complex objects in real time. The common method for fracture simulation in computer games is to pre-fracture models and replace objects by their pre-computed parts at run-time. This popular method is computationally cheap but has the disadvantages that the fracture pattern does not align with the impact location and that the number of hierarchical fracture levels is fixed. Our method allows dynamic fracturing of large objects into an unlimited number of pieces fast enough to be used in computer games. We represent visual meshes by volumetric approximate convex decompositions (VACD) and apply user-defined fracture patterns dependent on the impact location. The method supports partial fracturing meaning that fracture patterns can be applied locally at multiple locations of an object. We propose new methods for computing a VACD, for approximate convex hull construction and for detecting islands in the convex decomposition after partial destruction in order to determine support structures.

show abstract

Approximate convex decomposition of polyhedra

Cited by 47 publications

References 48 publications

Integrated model/scene construction through context-based search, data-driven suggestion and component replacement

Integrated model/scene construction through context-based search, data-driven suggestion and component replacement

Minimum Near-Convex Shape Decomposition

Real time dynamic fracture with volumetric approximate convex decompositions

Contact Info

Product

Resources

About