Bounding Proxies for Shape Approximation

被引:29
|
作者
Calderon, Stephane [1 ]
Boubekeur, Tamy [1 ]
机构
[1] Paris Saclay Univ, Telecom ParisTech, LTCI, Paris, France
来源
ACM TRANSACTIONS ON GRAPHICS | 2017年 / 36卷 / 04期
关键词
shape approximation; bounding volumes; mathematical morphology; geometric simplification; proxy; MORPHOLOGY; SIMPLIFICATION; ALGORITHM;
D O I
10.1145/3072959.3073714
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Many computer graphics applications use simpler yet faithful approximations of complex shapes to conduct reliably part of their computations. Some tasks, such as physical simulation, collision detection, occlusion queries or free-form deformation, require the simpler proxy to strictly enclose the input shape. While there are algorithms that can output such bounding proxies on simple input shapes, most of them fail at generating a proper coarse approximant on real-world complex shapes, which may contain multiple components and have a high genus. We advocate that, before reducing the number of primitives to describe a shape, one needs to regularize it while maintaining the strict enclosing property, to avoid any geometric aliasing that makes the decimation unreliable. Depending on the scale of the desired approximation, the topology of the shape itself may indeed have to be first simplified, to let the subsequent geometric optimization be free from topological locks. We propose a new bounding shape approximation algorithm which takes as input an arbitrary surface mesh, with potentially complex multicomponent structures, and generates automatically a bounding proxy which is tightened on the input and can match even the coarsest levels of approximation. To sustain the nonlinear approximation process that may eventually abstract both geometry and topology, we propose to use an intermediate regularized representation in the form of a shape closing, computed in real time using a new fast morphological framework designed for efficient parallel execution. Once the desired level of approximation is reached in the shape closing, a coarse, tight and bounding polygonization of the proxy geometry is extracted using an adaptive meshing scheme. Our underlying representation is both geometry-and topology-adaptive and can be optionally controlled accurately by a user, through sizing and orientation fields, yielding an intuitive brush metaphor within an interactive proxy design environment. We provide extensive experiments on various kinds of input meshes and illustrate the potential applications of our method in scenarios that benefit greatly from coarse, tight bounding substitutes to the actual high resolution geometry of the original 3D model, including freeform deformation, physical simulation and level of detail generation for rendering.
引用
收藏
页数:13
相关论文
共 50 条
  • [1] Minimum Volume Bounding Box decomposition for shape approximation in robot grasping
    Huebner, Kai
    Ruthotto, Steffen
    Kragic, Danica
    [J]. 2008 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-9, 2008, : 1628 - 1633
  • [2] Bounding the probabilities of benefit and harm through sensitivity parameters and proxies
    Pena, Jose M.
    [J]. JOURNAL OF CAUSAL INFERENCE, 2023, 11 (01)
  • [3] Spectral shape proxies and nonlinear structural response
    Bojorquez, Eden
    Iervolino, Iunio
    [J]. SOIL DYNAMICS AND EARTHQUAKE ENGINEERING, 2011, 31 (07) : 996 - 1008
  • [4] Bounding box splitting for robust shape classification
    Bauckhage, C
    Tsotsos, JK
    [J]. 2005 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), VOLS 1-5, 2005, : 1489 - 1492
  • [5] Bounding the Polynomial Approximation Errors of Frequency Response Functions
    Schoukens, Johan
    Vandersteen, Gerd
    Pintelon, Rik
    Emedi, Zlatko
    Rolain, Yves
    [J]. IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 2013, 62 (05) : 1346 - 1353
  • [6] Polytopal approximation bounding the number of k-faces
    Boroczky, K
    [J]. JOURNAL OF APPROXIMATION THEORY, 2000, 102 (02) : 263 - 285
  • [7] An Approximation Based Algorithm for Minimum Bounding Rectangle Computation
    Kala, Jules Raymond
    Viriri, Serestina
    Tapamo, Jules Raymond
    [J]. PROCEEDINGS OF THE 2014 IEEE 6TH INTERNATIONAL CONFERENCE ON ADAPTIVE SCIENCE AND TECHNOLOGY (ICAST 2014), 2014,
  • [8] KERNEL APPROXIMATION ON MANIFOLDS I: BOUNDING THE LEBESGUE CONSTANT
    Hangelbroek, T.
    Narcowich, F. J.
    Ward, J. D.
    [J]. SIAM JOURNAL ON MATHEMATICAL ANALYSIS, 2010, 42 (04) : 1732 - 1760
  • [9] The best approximation of bounding levels by bounded rational functions
    Vitkov, MG
    [J]. RADIOTEKHNIKA I ELEKTRONIKA, 1996, 41 (02): : 210 - 215
  • [10] Zometool shape approximation
    Zimmer, Henrik
    Lafarge, Florent
    Alliez, Pierre
    Kobbelt, Leif
    [J]. GRAPHICAL MODELS, 2014, 76 : 390 - 401