Cited by 2883D Shape Modeling and AnalysisComputational Geometry and Mesh GenerationGeometric Analysis and Curvature Flows

Geometric modeling in shape space

Kilian, Martin, Mitra, Niloy J., Pottmann, Helmut·2007·ACM SIGGRAPH 2007 papers

Abstract

We present a novel framework to treat shapes in the setting of Riemannian geometry. Shapes -- triangular meshes or more generally straight line graphs in Euclidean space -- are treated as points in a shape space. We introduce useful Riemannian metrics in this space to aid the user in design and modeling tasks, especially to explore the space of (approximately) isometric deformations of a given shape. Much of the work relies on an efficient algorithm to compute geodesics in shape spaces; to this end, we present a multi-resolution framework to solve the interpolation problem -- which amounts to solving a boundary value problem -- as well as the extrapolation problem -- an initial value problem -- in shape space. Based on these two operations, several classical concepts like parallel transport and the exponential map can be used in shape space to solve various geometric modeling and geometry processing tasks. Applications include shape morphing, shape deformation, deformation transfer, and intuitive shape exploration.

Integrity signals

Registry

Crossref · 10.1145/1275808.1276457

Cites

0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • A deformation of a shape represented by a triangular mesh is isometric if and only if all edge lengths are preserved during the deformation.

    “A deformation of a shape represented by a triangular mesh is isometric if and only if all edge lengths are preserved during the deformation [9].”

    From MORPHING OF TRIANGULAR MESHES IN SHAPE SPACE (2010) · cites this paper as [9]

  • The newly presented approaches solve the morphing problem without needing to solve a minimization problem.

    “All of the newly presented approaches solve the morphing problem without the need to solve a minimization problem.”

    From MORPHING OF TRIANGULAR MESHES IN SHAPE SPACE (2010) · cites this paper as [9]

  • Kilian et al. [9] used shape space representations to guide morphs and other deformations between triangular meshes, modeling deformations as geodesics in shape space found using an energy-minimization approach.

    “Recently, Kilian et al. [9] used shape space representations to guide morphs and other more general deformations between shapes represented as triangular meshes. Each shape is represented by a point in a high-dimensional shape space and deformations are modeled as geodesics in shape space. The geodesic paths in shape space are found using an energy-minimization approach.”

    From MORPHING OF TRIANGULAR MESHES IN SHAPE SPACE (2010) · cites this paper as [9]

  • The results of the averaging algorithm depend heavily on the initial rigid alignment of the shapes.

    “Just as in the algorithm by Kilian et al. [9], the results depend heavily on the initial rigid alignment of the shapes.”

    From MORPHING OF TRIANGULAR MESHES IN SHAPE SPACE (2010) · cites this paper as [9]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Kilian, M., Mitra, N. J., & Pottmann, H.
Affiliations
TU Wien (AT)
Venue
ACM SIGGRAPH 2007 papers
Publisher
ACM
Published
2007-07-29
Pages
64
OpenAlex
W2154084374
Cited by
224
References
0
Citations by year
2026: 5 · 2025: 3 · 2024: 4 · 2023: 6 · 2022: 6 · 2021: 11 · 2020: 12 · 2019: 12 · 2018: 10 · 2017: 14 · 2016: 11 · 2015: 19 · 2014: 16 · 2013: 12 · 2012: 18
FWCI
37.03
Type
conference paper
Language
en
Open access
closed
Locations
  • ACM SIGGRAPH Conference (SIGGRAPH) (publishedVersion)
  • UCL Discovery (University College London) (submittedVersion)
Topics
  • Physical Sciences › Engineering › Computational Mechanics › 3D Shape Modeling and Analysis
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
  • Physical Sciences › Mathematics › Applied Mathematics › Geometric Analysis and Curvature Flows
Keywords
shape space, Riemannian metrics, triangular meshes, straight line graphs, geodesics, boundary value problems, initial value problems, parallel transport, exponential map, shape morphing, shape deformation, deformation transfer, shape exploration, isometric deformations

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review