Browsing 29-Issue 5 by Title
Now showing items 12-25 of 25
-
Iso-geometric Finite Element Analysis Based on Catmull-Clark Subdivision Solids
(2010)We present a volumetric iso-geometric finite element analysis based on Catmull-Clark solids. This concept allows one to use the same representation for the modeling, the physical simulation, and the visualization, which ... -
Localized Delaunay Refinement for Sampling and Meshing
(2010)The technique of Delaunay renement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one lacuna that limits its application. It does not ... -
Mixed Finite Elements for Variational Surface Modeling
(2010)Many problems in geometric modeling can be described using variational formulations that define the smoothness of the shape and its behavior w.r.t. the posed modeling constraints. For example, high-qualityC2 surfaces that ... -
Moebius Transformations For Global Intrinsic Symmetry Analysis
(2010)The goal of our work is to develop an algorithm for automatic and robust detection of global intrinsic symmetries in 3D surface meshes. Our approach is based on two core observations. First, symmetry invariant point sets ... -
Moving Least Squares Coordinates
(2010)We propose a new family of barycentric coordinates that have closed-forms for arbitrary 2D polygons. These coordinates are easy to compute and have linear precision even for open polygons. Not only do these coordinates ... -
Multi-scale Geometric Modeling of Ambiguous Shapes with Toleranced Balls and Compoundly Weighted a-shapes
(2010)Dealing with ambiguous data is a challenge in Science in general and geometry processing in particular. One route of choice to extract information from such data consists of replacing the ambiguous input by a continuum, ... -
On Discrete Killing Vector Fields and Patterns on Surfaces
(2010)Symmetry is one of the most important properties of a shape, unifying form and function. It encodes semantic information on one hand, and affects the shape's aesthetic value on the other. Symmetry comes in many flavors, ... -
One Point Isometric Matching with the Heat Kernel
(2010)A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particularly useful case of such maps is isometries, ... -
Persistent Heat Signature for Pose-oblivious Matching of Incomplete Models
(2010)Although understanding of shape features in the context of shape matching and retrieval has made considerable progress in recent years, the case for partial and incomplete models in presence of pose variations still begs ... -
Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes
(2010)Abstract We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Minkowski addition, offsetting, and ... -
Polygonal Mesh Watermarking Using Laplacian Coordinates
(2010)We propose a watermarking algorithm for polygonal meshes based on the modification of the Laplacian coordinates. More specifically, we first compute the Laplacian coordinates (x, y, z) of the mesh vertices, then construct ... -
Scales and Scale-like Structures
(2010)We present a method for generating scales and scale-like structures on a polygonal mesh through surface replacement. As input, we require a triangular mesh that will be covered with scales and one or more proxy-models to ... -
Signing the Unsigned: Robust Surface Reconstruction from Raw Pointsets
(2010)We propose a modular framework for robust 3D reconstruction from unorganized, unoriented, noisy, and outlierridden geometric data. We gain robustness and scalability over previous methods through an unsigned distance ... -
Trivial Connections on Discrete Surfaces
(2010)This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities with given index. We compute these connections ...