Book Section records
https://feeds.library.caltech.edu/people/Schröder-P/book_section.rss
A Caltech Library Repository Feedhttp://www.rssboard.org/rss-specificationpython-feedgenenTue, 16 Apr 2024 14:15:05 +0000The virtual erector set: dynamic simulation with linear recursive constraint propagation
https://resolver.caltech.edu/CaltechAUTHORS:20230210-663927000.2
Authors: {'items': [{'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}, {'id': 'Zeltzer-David', 'name': {'family': 'Zeltzer', 'given': 'David'}}]}
Year: 1990
DOI: 10.1145/91385.91403
We have implemented an algorithm for rigid body dynamics which unifies the advantages of linear recursive algorithms with the advantages of earlier linear algebra based constraint force approaches. No restriction is placed on the joints between links. The algorithm is numerically robust and can deal with arbitrary trees of bodies, including kinematic loops. Motion as well as force constraints on the dynamic behavior of any member of the linkage can be added easily. Through the use of spatial algebra notation---including our extension to account for spatial position---the mathematical expressions are simplified and more efficient to execute. The algorithm has been implemented on workstation class machines and performs at interactive speeds.https://authors.library.caltech.edu/records/r0h7j-q5w70Interpolating Subdivision for meshes with arbitrary topology
https://resolver.caltech.edu/CaltechAUTHORS:20170110-142159612
Authors: {'items': [{'id': 'Zorin-D', 'name': {'family': 'Zorin', 'given': 'Denis'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}, {'id': 'Sweldens-W', 'name': {'family': 'Sweldens', 'given': 'Wim'}}]}
Year: 1996
DOI: 10.1145/237170.237254
Subdivision is a powerful paradigm for the generation of surfaces of arbitrary topology. Given an initial triangular mesh the goal is to produce a smooth and visually pleasing surface whose shape is controlled by the initial mesh. Of particular interest are interpolating
schemes since they match the original data exactly, and play an important role in fast multiresolution and wavelet techniques. Dyn, Gregory, and Levin introduced the Butterfly scheme, which yields C^1 surfaces in the topologically regular setting. Unfortunately it
exhibits undesirable artifacts in the case of an irregular topology. We examine these failures and derive an improved scheme, which retains the simplicity of the Butterfly scheme, is interpolating, and results in smoother surfaces.https://authors.library.caltech.edu/records/f611x-ncq34Interactive multiresolution mesh editing
https://resolver.caltech.edu/CaltechAUTHORS:20170110-142949739
Authors: {'items': [{'id': 'Zorin-D', 'name': {'family': 'Zorin', 'given': 'Denis'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}, {'id': 'Sweldens-W', 'name': {'family': 'Sweldens', 'given': 'Wim'}}]}
Year: 1997
DOI: 10.1145/258734.258863
We describe a multiresolution representation for meshes based on subdivision, which is a natural extension of the existing patch-based surface representations. Combining subdivision and the smoothing algorithms of Taubin [26] allows us to construct a set of algorithms for interactive multiresolution editing of complex hierarchical meshes of arbitrary topology. The simplicity of the underlying algorithms for refinement and coarsification enables us to make them local and adaptive, thereby considerably improving their efficiency. We have built a scalable interactive multiresolution editing system based on such algorithms.https://authors.library.caltech.edu/records/8pgy8-v9306Multiresolution signal processing for meshes
https://resolver.caltech.edu/CaltechAUTHORS:20161101-170259438
Authors: {'items': [{'id': 'Guskov-I', 'name': {'family': 'Guskov', 'given': 'Igor'}}, {'id': 'Sweldens-W', 'name': {'family': 'Sweldens', 'given': 'Wim'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 1999
DOI: 10.1145/311535.311577
We generalize basic signal processing tools such as downsampling, upsampling, and filters to irregular connectivity triangle meshes. This is accomplished through the design of a non-uniform relaxation procedure whose weights depend on the geometry and we
show its superiority over existing schemes whose weights depend only on connectivity. This is combined with known mesh simplification methods to build subdivision and pyramid algorithms. We demonstrate the power of these algorithms through a number of application examples including smoothing, enhancement, editing, and texture mapping.https://authors.library.caltech.edu/records/pan4n-v6f04Multiresolution mesh morphing
https://resolver.caltech.edu/CaltechAUTHORS:20161121-171932398
Authors: {'items': [{'id': 'Lee-A-W-F', 'name': {'family': 'Lee', 'given': 'Aaron W. F.'}}, {'id': 'Dobkin-D', 'name': {'family': 'Dobkin', 'given': 'David'}}, {'id': 'Sweldens-W', 'name': {'family': 'Sweldens', 'given': 'Wim'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 1999
DOI: 10.1145/311535.311586
We present a new method for user controlled morphing of two
homeomorphic triangle meshes of arbitrary topology. In particular we focus on the problem of establishing a correspondence map between source and target meshes. Our method employs the MAPS algorithm to parameterize both meshes over simple base domains and an additional harmonic map bringing the latter into correspondence.
To control the mapping the user specifies any number of
feature pairs, which control the parameterizations produced by the MAPS algorithm. Additional controls are provided through a direct manipulation interface allowing the user to tune the mapping between the base domains. We give several examples of æsthetically pleasing morphs which can be created in this manner with little user input. Additionally we demonstrate examples of temporal
and spatial control over the morph.https://authors.library.caltech.edu/records/nfb5k-mpm37Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow
https://resolver.caltech.edu/CaltechAUTHORS:20161006-145432340
Authors: {'items': [{'id': 'Desbrun-M', 'name': {'family': 'Desbrun', 'given': 'Mathieu'}, 'orcid': '0000-0003-3424-6079'}, {'id': 'Meyer-M', 'name': {'family': 'Meyer', 'given': 'Mark'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}, {'id': 'Barr-A-H', 'name': {'family': 'Barr', 'given': 'Alan H.'}}]}
Year: 1999
DOI: 10.1145/311535.311576
In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem
arises mainly when creating high-fidelity computer graphics objects using imperfectly-measured data from the real world.
Our approach contains three novel features: an implicit integration method to achieve efficiency, stability, and large time-steps; a scale-dependent Laplacian operator to improve the diffusion process; and finally, a robust curvature flow operator that achieves a smoothing of the shape itself, distinct from any parameterization.
Additional features of the algorithm include automatic exact volume preservation, and hard and soft constraints on the positions of the points in the mesh.
We compare our method to previous operators and related algorithms, and prove that our curvature and Laplacian operators have several mathematically-desirable qualities that improve the appearance of the resulting surface. In consequence, the user can easily select the appropriate operator according to the desired type of fairing.
Finally, we provide a series of examples to graphically and
numerically demonstrate the quality of our results.https://authors.library.caltech.edu/records/8jp32-h3186Building your own wavelets at home
https://resolver.caltech.edu/CaltechAUTHORS:20200212-145736556
Authors: {'items': [{'id': 'Sweldens-W', 'name': {'family': 'Sweldens', 'given': 'Wim'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2000
DOI: 10.1007/bfb0011093
Wavelets have been making an appearance in many pure and applied areas of science and engineering. Computer graphics with its many and varied computational problems has been no exception to this rule. In these notes we will attempt to motivate and explain the basic ideas behind wavelets and what makes them so successful in application areas.https://authors.library.caltech.edu/records/gsa51-bm390Progressive geometry compression
https://resolver.caltech.edu/CaltechAUTHORS:20161116-151004261
Authors: {'items': [{'id': 'Khodakovsky-A', 'name': {'family': 'Khodakovsky', 'given': 'Andrei'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}, {'id': 'Sweldens-W', 'name': {'family': 'Sweldens', 'given': 'Wim'}}]}
Year: 2000
DOI: 10.1145/344779.344922
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely sampled meshes arising from geometry scanning. We observe that meshes consist of three distinct components: geometry, parameter, and connectivity information. The latter two do not contribute to the reduction of error in a compression setting. Using semi-regular meshes, parameter and connectivity information can be virtually eliminated. Coupled with semi-regular wavelet transforms, zerotree coding, and subdivision based reconstruction we see improvements in error by a factor four (12dB) compared to other progressive coding schemes.https://authors.library.caltech.edu/records/nh6mt-v8v09Normal meshes
https://resolver.caltech.edu/CaltechAUTHORS:20161101-171342645
Authors: {'items': [{'id': 'Guskov-I', 'name': {'family': 'Guskov', 'given': 'Igor'}}, {'id': 'Vidimče-K', 'name': {'family': 'Vidimče', 'given': 'Kiril'}}, {'id': 'Sweldens-W', 'name': {'family': 'Sweldens', 'given': 'Wim'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2000
DOI: 10.1145/344779.344831
Normal meshes are new fundamental surface descriptions inspired by differential geometry. A normal mesh is a multiresolution mesh where each level can be written as a normal offset from a coarser version. Hence the mesh can be stored with a single float per vertex. We present an algorithm to approximate any surface arbitrarily closely with a normal semi-regular mesh. Normal meshes can be useful in numerous applications such as compression, filtering, rendering, texturing, and modeling.https://authors.library.caltech.edu/records/adw4q-q6e15Semi-regular mesh extraction from volumes
https://resolver.caltech.edu/CaltechAUTHORS:20170110-140538420
Authors: {'items': [{'id': 'Wood-Z-J', 'name': {'family': 'Wood', 'given': 'Zoë J.'}}, {'id': 'Desbrun-M', 'name': {'family': 'Desbrun', 'given': 'Mathieu'}, 'orcid': '0000-0003-3424-6079'}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}, {'id': 'Breen-D', 'name': {'family': 'Breen', 'given': 'David'}}]}
Year: 2000
DOI: 10.1109/VISUAL.2000.885705
We present a novel method to extract iso-surfaces from distance volumes. It generates high quality semi-regular multiresolution meshes of arbitrary topology. Our technique proceeds in two stages. First, a very coarse mesh with guaranteed topology is extracted. Subsequently an iterative multi-scale force-based solver refines the initial mesh into a semi-regular mesh with geometrically adaptive sampling rate and good aspect ratio triangles. The coarse mesh extraction is performed using a new approach we call surface wavefront propagation. A set of discrete iso-distance ribbons are rapidly built and connected while respecting the topology of the iso-surface implied by the data. Subsequent multi-scale refinement is driven by a simple force-based solver designed to combine good iso-surface fit and high quality sampling through reparameterization. In contrast to the Marching Cubes technique our output meshes adapt gracefully to the iso-surface geometry, have a natural multiresolution structure and good aspect ratio triangles, as demonstrated with a number of examples.https://authors.library.caltech.edu/records/zkjvh-vp666Surface drawing: creating organic 3D shapes with the hand and tangible tools
https://resolver.caltech.edu/CaltechAUTHORS:20161215-155712856
Authors: {'items': [{'id': 'Schkolne-S', 'name': {'family': 'Schkolne', 'given': 'Steven'}}, {'id': 'Pruett-M', 'name': {'family': 'Pruett', 'given': 'Michael'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2001
DOI: 10.1145/365024.365114
Surface Drawing is a system for creating organic 3D shapes in a manner which supports the needs and interests of artists. This medium facilitates the early stages of creative design which many 3D modeling programs neglect. Much like traditional media such as line drawing and painting, Surface Drawing lets users construct shapes through repeated marking. In our case, the hand is used to mark 3D space in a semi-immersive virtual environment. The interface is completed with tangible tools to edit and manipulate models. We introduce the use of tongs to move and scale 3D shapes and demonstrate a magnet tool which is comfortably held without restricting hand motion. We evaluated our system through collaboration with artists and designers, exhibition before hundreds of users, our own extensive exploration of the medium, and an informal user study. Response was especially positive from users with an artistic background.https://authors.library.caltech.edu/records/12r6y-23d65Subdivision, multiresolution and the construction of scalable algorithms in computer graphics
https://resolver.caltech.edu/CaltechAUTHORS:20230210-140523000.1
Authors: {'items': [{'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'P.'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2001
DOI: 10.1017/cbo9780511569616.009
Multiresolution representations are a critical tool in addressing complexity issues (time and memory) for the large scenes typically found in computer graphics applications. Many of these techniques are based on classical subdivision techniques and their generalizations. In this chapter we review two exemplary applications from this area, multiresolution surface editing and semi-regular remeshing. The former is directed towards building algorithms which are fast enough for interactive manipulation of complex surfaces of arbitrary topology. The latter is concerned with constructing smooth parameterizations for arbitrary topology surfaces as they typically arise from 3D scanning techniques. Remeshing such surfaces then allows the use of classical subdivision ideas. We focus in particular on the practical aspects of making the well-understood mathematical machinery applicable and accessible to the very general settings encountered in practice.https://authors.library.caltech.edu/records/qxzrv-j6944Normal bounds for subdivision-surface interference detection
https://resolver.caltech.edu/CaltechAUTHORS:20161031-164830677
Authors: {'items': [{'id': 'Grinspun-Eitan', 'name': {'family': 'Grinspun', 'given': 'Eitan'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2001
DOI: 10.1109/VISUAL.2001.964529
Subdivision surfaces are an attractive representation when modeling arbitrary-topology free-form surfaces and show great promise for applications in engineering design and computer animation. Interference detection is a critical tool in many of these applications. In this paper, we derive normal bounds for subdivision surfaces and use these to develop an efficient algorithm for (self-) interference detection.https://authors.library.caltech.edu/records/29wyc-py283Rapid Evaluation of Catmull-Clark Subdivision Surfaces
https://resolver.caltech.edu/CaltechAUTHORS:20160809-163838344
Authors: {'items': [{'id': 'Bolz-J', 'name': {'family': 'Bolz', 'given': 'Jeffrey'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2002
DOI: 10.1145/504502.504505
Using subdivision as a basic primitive for the construction of arbitrary topology, smooth, free-form surfaces is attractive for content destined for display on devices with greatly varying rendering performance. Subdivision naturally supports level of detail rendering and powerful compression algorithms. While the underlying algorithms are conceptually simple it is difficult to implement player engines which achieve optimal performance on modern CPUs such as the Intel Pentium family.
In this paper we describe a novel table driven evaluation strategy for subdivision surfaces using as an example the scheme of Catmull and Clark. Cache conscious design and exploitation of SIMD instructions allows us to achieve nearly 100% FPU utilization in the inner loop and achieve a composite performance of 1.2 flop/cycle on the Intel PIII and 1.8 flop/cycle on the Intel P4 including all memory transfers. The algorithm supports tradeoffs between cache size and memory bus usage which we examine. A library which implements this engine is freely available from the authors.https://authors.library.caltech.edu/records/avvac-b2z04Hybrid Meshes: Multiresolution using regular and irregular refinement
https://resolver.caltech.edu/CaltechAUTHORS:20161031-172646085
Authors: {'items': [{'id': 'Guskov-I', 'name': {'family': 'Guskov', 'given': 'Igor'}}, {'id': 'Khodakovsky-A', 'name': {'family': 'Khodakovsky', 'given': 'Andrei'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}, {'id': 'Sweldens-W', 'name': {'family': 'Sweldens', 'given': 'Wim'}}]}
Year: 2002
DOI: 10.1145/513400.513443
A hybrid mesh is a multiresolution surface representation that combines advantages from regular and irregular meshes. Irregular operations allow a hybrid mesh to change topology throughout the hierarchy and approximate detailed features at multiple scales. A preponderance of regular refinements allows for efficient data-structures and processing algorithms. We provide a user driven procedure for creating a hybrid mesh from scanned geometry and present a progressive hybrid mesh compression algorithm.https://authors.library.caltech.edu/records/p3qje-mxq48CHARMS: a simple framework for adaptive simulation
https://resolver.caltech.edu/CaltechAUTHORS:20161031-164831941
Authors: {'items': [{'id': 'Grinspun-Eitan', 'name': {'family': 'Grinspun', 'given': 'Eitan'}}, {'id': 'Krysl-Petr', 'name': {'family': 'Krysl', 'given': 'Petr'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2002
DOI: 10.1145/566570.566578
Finite element solvers are a basic component of simulation applications; they are common in computer graphics, engineering, and medical simulations. Although adaptive solvers can be of great value in reducing the often high computational cost of simulations they are not employed broadly. Indeed, building adaptive solvers can be a daunting task especially for 3D finite elements. In this paper we are introducing a new approach to produce conforming, hierarchical, adaptive refinement methods (CHARMS). The basic principle of our approach is to refine basis functions, not elements. This removes a number of implementation headaches associated with other approaches and is a general technique independent of domain dimension (here 2D and 3D), element type (e.g., triangle, quad, tetrahedron, hexahedron), and basis function order (piece-wise linear, higher order B-splines, Loop subdivision, etc.). The (un-)refinement algorithms are simple and require little in terms of data structure support. We demonstrate the versatility of our new approach through 2D and 3D examples, including medical applications and thin-shell animations.https://authors.library.caltech.edu/records/n3p6m-3wf28Discrete Differential-Geometry Operators for Triangulated 2-Manifolds
https://resolver.caltech.edu/CaltechAUTHORS:20191009-101951616
Authors: {'items': [{'id': 'Meyer-Mark', 'name': {'family': 'Meyer', 'given': 'Mark'}}, {'id': 'Desbrun-M', 'name': {'family': 'Desbrun', 'given': 'Mathieu'}, 'orcid': '0000-0003-3424-6079'}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}, {'id': 'Barr-A-H', 'name': {'family': 'Barr', 'given': 'Alan H.'}}]}
Year: 2003
DOI: 10.1007/978-3-662-05105-4_2
This paper proposes a unified and consistent set of flexible tools to approximate important geometric attributes, including normal vectors and curvatures on arbitrary triangle meshes. We present a consistent derivation of these first and second order differential properties using averaging Voronoi cells and the mixed Finite-Element/Finite-Volume method, and compare them to existing formulations. Building upon previous work in discrete geometry, these operators are closely related to the continuous case, guaranteeing an appropriate extension from the continuous to the discrete setting: they respect most intrinsic properties of the continuous differential operators. We show that these estimates are optimal in accuracy under mild smoothness conditions, and demonstrate their numerical quality. We also present applications of these operators, such as mesh smoothing, enhancement, and quality checking, and show results of denoising in higher dimensions, such as for tensor images.https://authors.library.caltech.edu/records/z23e7-31x10Data-dependent fairing of subdivision surfaces
https://resolver.caltech.edu/CaltechAUTHORS:20161024-173523014
Authors: {'items': [{'id': 'Friedel-I', 'name': {'family': 'Friedel', 'given': 'Ilja'}}, {'id': 'Mullen-P', 'name': {'family': 'Mullen', 'given': 'Patrick'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2003
DOI: 10.1145/781606.781635
In this paper we present a new algorithm for solving the data dependent fairing problem for subdivision surfaces, using Catmull-Clark surfaces as an example. Earlier approaches to subdivision surface fairing encountered problems with singularities in the parametrization of the surface. We address these issues through the use of the characteristic map parametrization, leading to well defined membrane and bending energies even at irregular vertices. Combining this approach with ideas from data-dependent energy operators we are able to express the associated nonlinear stiffness matrices for Catmull-Clark surfaces as linear combinations of precomputed energy matrices. This machinery also provides exact, inexpensive gradients and Hessians of the new energy operators. With these the nonlinear minimization problem can be solved in a stable and efficient way using Steihaug's Newton/CG trust-region method. We compare properties of linear and nonlinear methods through a number of examples and report on the performance of the algorithm.https://authors.library.caltech.edu/records/61t5m-4f904Sparse Matrix Solvers on the GPU: Conjugate Gradients and Multigrid
https://resolver.caltech.edu/CaltechAUTHORS:20160809-162351341
Authors: {'items': [{'id': 'Bolz-Jeff', 'name': {'family': 'Bolz', 'given': 'Jeff'}}, {'id': 'Farmer-Ian', 'name': {'family': 'Farmer', 'given': 'Ian'}}, {'id': 'Grinspun-Eitan', 'name': {'family': 'Grinspun', 'given': 'Eitan'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2003
DOI: 10.1145/1201775.882364
Many computer graphics applications require high-intensity numerical simulation. We show that such computations can be performed efficiently on the GPU, which we regard as a full function streaming processor with high floating-point performance. We implemented two basic, broadly useful, computational kernels: a sparse matrix conjugate gradient solver and a regular-grid multigrid solver. Real-time applications ranging from mesh smoothing and parameterization to fluid solvers and solid mechanics can greatly benefit from these, evidence our example applications of geometric flow and fluid simulation running on NVIDIA's GeForce FX.https://authors.library.caltech.edu/records/j76nk-kg240Progressive encoding of complex isosurfaces
https://resolver.caltech.edu/CaltechAUTHORS:20161121-173322261
Authors: {'items': [{'id': 'Lee-Haeyoung', 'name': {'family': 'Lee', 'given': 'Haeyoung'}}, {'id': 'Desbrun-M', 'name': {'family': 'Desbrun', 'given': 'Mathieu'}, 'orcid': '0000-0003-3424-6079'}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2003
DOI: 10.1145/1201775.882294
We present a progressive encoding technique specifically designed for complex isosurfaces. It achieves better rate distortion performance than all standard mesh coders, and even improves on all previous single rate isosurface coders. Our novel algorithm handles isosurfaces with or without sharp features, and deals gracefully with high topologic and geometric complexity. The inside/outside function of the volume data is progressively transmitted through the use of an adaptive octree, while a local frame based encoding is used for the fine level placement of surface samples. Local patterns in topology and local smoothness in geometry are exploited by context-based arithmetic encoding, allowing us to achieve an average of 6.10 bits per vertex (b/v) at very low distortion. Of this rate only 0.65 b/v are dedicated to connectivity data: this improves by 24% over the best previous single rate isosurface encoder.https://authors.library.caltech.edu/records/7j7gt-q9k05Globally smooth parameterizations with low distortion
https://resolver.caltech.edu/CaltechAUTHORS:20161116-142436970
Authors: {'items': [{'id': 'Khodakovsky-A', 'name': {'family': 'Khodakovsky', 'given': 'Andrei'}}, {'id': 'Litke-N', 'name': {'family': 'Litke', 'given': 'Nathan'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2003
DOI: 10.1145/1201775.882275
Good parameterizations are of central importance in many digital geometry processing tasks. Typically the behavior of such processing algorithms is related to the smoothness of the parameterization and how much distortion it contains. Since a parameterization maps a bounded region of the plane to the surface, a parameterization for a surface which is not homeomorphic to a disc must be made up of multiple pieces. We present a novel parameterization algorithm for arbitrary topology surface meshes which computes a globally smooth parameterization with low distortion. We optimize the patch layout subject to criteria such as shape quality and metric distortion, which are used to steer a mesh simplification approach for base complex construction. Global smoothness is achieved through simultaneous relaxation over all patches, with suitable transition functions between patches incorporated into the relaxation procedure. We demonstrate the quality of our parameterizations through numerical evaluation of distortion measures and the excellent rate distortion performance of semi-regular remeshes produced with these parameterizations. The numerical algorithms required to compute the parameterizations are robust and run on the order of minutes even for large meshes.https://authors.library.caltech.edu/records/y3x49-v7a86Discrete shells
https://resolver.caltech.edu/CaltechAUTHORS:20161031-163604983
Authors: {'items': [{'id': 'Grinspun-E', 'name': {'family': 'Grinspun', 'given': 'Eitan'}}, {'id': 'Hirani-A-N', 'name': {'family': 'Hirani', 'given': 'Anil N.'}}, {'id': 'Desbrun-M', 'name': {'family': 'Desbrun', 'given': 'Mathieu'}, 'orcid': '0000-0003-3424-6079'}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2003
DOI: 10.2312/SCA03/062-067
In this paper we introduce a discrete shell model describing the behavior of thin flexible structures, such as hats, leaves, and aluminum cans, which are characterized by a curved undeformed configuration. Previously such models required complex continuum mechanics formulations and correspondingly complex algorithms. We show that a simple shell model can be derived geometrically for triangle meshes and implemented quickly by modifying a standard cloth simulator. Our technique convincingly simulates a variety of curved objects with materials ranging from paper to metal, as we demonstrate with several examples including a comparison of a real and simulated falling hat.https://authors.library.caltech.edu/records/nagsj-q9097Immersive design of DNA molecules with a tangible interface
https://resolver.caltech.edu/CaltechAUTHORS:20230210-663941000.4
Authors: {'items': [{'id': 'Schkolne-Steven', 'name': {'family': 'Schkolne', 'given': 'Steven'}}, {'id': 'Ishii-Hiroshi', 'name': {'family': 'Ishii', 'given': 'Hiroshi'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2004
DOI: 10.1109/visual.2004.47
This paper presents an experimental immersive interface for designing DNA components for application in nanotechnology. While much research has been done on immersive visualization, this is one of the first systems to apply advanced interface techniques to a scientific design problem. This system uses tangible 3D input devices (tongs, a raygun, and a multipurpose handle tool) to create and edit a purely digital representation of DNS. The tangible controllers are associated with functions (not data) while a virtual display is used to render the model. This interface was built in collaboration with a research group investigating the design of DNA tiles. A user study shows that scientists find the immersive interface more satisfying than a 2D interface due to the enhanced understanding gained by directly interacting with molecules in 3D space.https://authors.library.caltech.edu/records/0x6d3-g4132Immersive design of DMA molecules with a tangible interface
https://resolver.caltech.edu/CaltechAUTHORS:20161215-153951824
Authors: {'items': [{'id': 'Schkolne-S', 'name': {'family': 'Schkolne', 'given': 'Steven'}}, {'id': 'Ishii-Hiroshi', 'name': {'family': 'Ishii', 'given': 'Hiroshi'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2004
DOI: 10.1109/VISUAL.2004.47
This work presents an experimental immersive interface for designing DNA components for application in nanotechnology. While much research has been done on immersive visualization, this is one of the first systems to apply advanced interface techniques to a scientific design problem. This system uses tangible 3D input devices (tongs, a raygun, and a multipurpose handle tool) to create and edit a purely digital representation of DNA. The tangible controllers are associated with functions (not data) while a virtual display is used to render the model. This interface was built in collaboration with a research group investigating the design of DNA tiles. A user study shows that scientists find the immersive interface more satisfying than a 2D interface due to the enhanced understanding gained by directly interacting with molecules in 3D space.https://authors.library.caltech.edu/records/azba5-9bf97Discrete Willmore flow
https://resolver.caltech.edu/CaltechAUTHORS:20160725-115639350
Authors: {'items': [{'id': 'Bobenko-A-I', 'name': {'family': 'Bobenko', 'given': 'Alexander I.'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2005
The Willmore energy of a surface, ∫(H^2 -- K) dA, as a function of mean and Gaussian curvature, captures the deviation of a surface from (local) sphericity. As such this energy and its associated gradient flow play an important role in digital geometry processing, geometric modeling, and physical simulation. In this paper we consider a discrete Willmore energy and its flow. In contrast to traditional approaches it is not based on a finite element discretization, but rather on an ab initio discrete formulation which preserves the Möbius symmetries of the underlying continuous theory in the discrete setting. We derive the relevant gradient expressions including a linearization (approximation of the Hessian), which are required for non-linear numerical solvers. As examples we demonstrate the utility of our approach for surface restoration, n-sided hole filling, and non-shrinking surface smoothing.https://authors.library.caltech.edu/records/rjf0f-x9266Discrete Willmore Flow
https://resolver.caltech.edu/CaltechAUTHORS:20160725-114846575
Authors: {'items': [{'id': 'Bobenko-A-I', 'name': {'family': 'Bobenko', 'given': 'Alexander I.'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2005
DOI: 10.1145/1198555.1198664
The Willmore energy of a surface, ∫(H^2 - K) dA, as a function of mean and Gaussian curvature, captures the deviation of a surface from (local) sphericity. As such this energy and its associated gradient flow play an important role in digital geometry processing, geometric modeling, and physical simulation. In this paper we consider a discrete Willmore energy and its flow. In contrast to traditional approaches it is not based on a finite element discretization, but rather on an ab initio discrete formulation which preserves the Möbius symmetries of the underlying continuous theory in the discrete setting. We derive the relevant gradient expressions including a linearization (approximation of the Hessian), which are required for non-linear numerical solvers. As examples we demonstrate the utility of our approach for surface restoration, n-sided hole filling, and non-shrinking surface smoothing.https://authors.library.caltech.edu/records/0j26w-82a57What can we measure?
https://resolver.caltech.edu/CaltechAUTHORS:20161215-161533538
Authors: {'items': [{'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2005
DOI: 10.1145/1198555.1198661
When characterizing a shape or changes in shape we must first ask, what can we measure about a shape? For example, for a region in ℝ^3 we may ask for its volume or its surface area. If the object at hand undergoes deformation due to forces acting on it we may need to formulate the laws governing the change in shape in terms of measurable quantities and their change over time. Usually such measurable quantities for a shape are defined with the help of integral calculus and often require some amount of smoothness on the object to be well defined. In this chapter we will take a more abstract approach to the question of measurable quantities which will allow us to define notions such as mean curvature integrals and the curvature tensor for piecewise linear meshes without having to worry about the meaning of second derivatives in settings in which they do not exist. In fact in this chapter we will give an account of a classical result due to Hadwiger, which shows that for a convex, compact set in ℝ^n there are only n + 1 unique measurements if we require that the measurements be invariant under Euclidian motions (and satisfy certain "sanity" conditions). We will see how these measurements are constructed in a very straightforward and elementary manner and that they can be read off from a characteristic polynomial due to Steiner. This polynomial describes the volume of a family of shapes which arise when we "grow" a given shape. As a practical tool arising from these consideration we will see that there is a well defined notion of the curvature tensor for piece-wise linear meshes and we will see very simple formulas for quantities needed in physical simulation with piecewise linear meshes. Much of the treatment here will initially be limited to convex bodies to keep things simple. This limitation that will be removed at the very end.https://authors.library.caltech.edu/records/hsbr1-mq960Unconstrained spherical parameterization
https://resolver.caltech.edu/CaltechAUTHORS:20161024-174100275
Authors: {'items': [{'id': 'Friedel-I', 'name': {'family': 'Friedel', 'given': 'Ilja'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}, {'id': 'Desbrun-M', 'name': {'family': 'Desbrun', 'given': 'Mathieu'}, 'orcid': '0000-0003-3424-6079'}]}
Year: 2005
DOI: 10.1145/1187112.1187274
[no abstract]https://authors.library.caltech.edu/records/c019p-pq895Discrete, Vorticity-Preserving, and Stable Simplicial Fluids
https://resolver.caltech.edu/CaltechAUTHORS:20161011-165249647
Authors: {'items': [{'id': 'Elcott-S', 'name': {'family': 'Elcott', 'given': 'Sharif'}}, {'id': 'Tong-Yiying', 'name': {'family': 'Tong', 'given': 'Yiying'}}, {'id': 'Kanso-E', 'name': {'family': 'Kanso', 'given': 'Eva'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}, {'id': 'Desbrun-M', 'name': {'family': 'Desbrun', 'given': 'Mathieu'}, 'orcid': '0000-0003-3424-6079'}]}
Year: 2005
DOI: 10.1145/1198555.1198668
Visual accuracy, low computational cost, and numerical stability are foremost goals in computer animation. An important ingredient in achieving these goals is the conservation of fundamental motion invariants. For example, rigid or deformable body simulation have benefited greatly from conservation of linear and angular momenta. In the case of fluids, however, none of the current techniques focuses on conserving invariants, and consequently, they often introduce a visually disturbing numerical diffusion of
vorticity. Visually just as important is the resolution of complex simulation domains. Doing so with regular (even if adaptive) grid techniques can be computationally delicate.
In this chapter, we propose a novel technique for the simulation of fluid flows. It is designed to respect the defining differential properties, i.e., the
conservation of circulation along arbitrary loops as
they are transported by the flow. Consequently, our method offers several new and desirable properties: (1) arbitrary simplicial meshes (triangles in 2D, tetrahedra in 3D) can be used to define the fluid domain; (2) the computations are efficient due to discrete operators with small support; (3) the method is stable for arbitrarily large time steps; and (4) it preserves a discrete circulation
avoiding numerical diffusion of vorticity. The underlying ideas are easy to incorporate in current approaches to fluid simulation and should thus prove valuable in many applications.https://authors.library.caltech.edu/records/66jk7-ms511Discrete conformal mappings via circle patterns
https://resolver.caltech.edu/CaltechAUTHORS:20161116-140825377
Authors: {'items': [{'id': 'Kharevych-L', 'name': {'family': 'Kharevych', 'given': 'Liliya'}}, {'id': 'Springborn-B', 'name': {'family': 'Springborn', 'given': 'Boris'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2005
DOI: 10.1145/1198555.1198665
We introduce a novel method for the construction of discrete conformal mappings from (regions of) embedded meshes to the plane. Our approach is based on circle patterns, i.e., arrangements of circles---one for each face---with prescribed intersection angles. Given these angles the circle radii follow as the unique minimizer of a convex energy. The method has two principal advantages over earlier approaches based on discrete harmonic mappings: (1) it supports very flexible boundary conditions ranging from natural boundaries to control of the boundary shape via prescribed curvatures; (2) the solution is based on a convex energy as a function of logarithmic radius variables with simple explicit expressions for gradients and Hessians, greatly facilitating robust and efficient numerical treatment. We demonstrate the versatility and performance of our algorithm with a variety of examples.https://authors.library.caltech.edu/records/fhw0y-xf962Building your own DEC at home
https://resolver.caltech.edu/CaltechAUTHORS:20161011-163903630
Authors: {'items': [{'id': 'Elcott-S', 'name': {'family': 'Elcott', 'given': 'Sharif'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2005
DOI: 10.1145/1198555.1198667
The methods of Discrete Exterior Calculus (DEC) have given birth to many new algorithms applicable to areas such as fluid simulation, deformable body simulation, and others. Despite the (possibly intimidating) mathematical theory that went into deriving these algorithms, in the end they lead to simple, elegant, and straightforward implementations. However, readers interested in implementing them should note that the algorithms presume the existence of a suitable simplicial complex data structure. Such a data structure needs to support local traversal of elements, adjacency information for all dimensions of simplices, a notion of a dual mesh, and all simplices must be oriented. Unfortunately, most publicly available tetrahedral mesh libraries provide only unoriented representations with little more than vertex-tet adjacency information (while we need vertex-edge, edge-triangle, edge-tet, etc.). For those eager to implement and build on the algorithms presented in this course without having to worry about these details, we provide an implementation of a DEC-friendly tetrahedral mesh data structure in C++. This chapter documents the ideas behind the implementation.https://authors.library.caltech.edu/records/b0vp9-dvf44An Image Processing Approach to Surface Matching
https://resolver.caltech.edu/CaltechAUTHORS:20161122-170753654
Authors: {'items': [{'id': 'Litke-N', 'name': {'family': 'Litke', 'given': 'Nathan'}}, {'id': 'Droske-M', 'name': {'family': 'Droske', 'given': 'Marc'}}, {'id': 'Rumpf-M', 'name': {'family': 'Rumpf', 'given': 'Martin'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2005
DOI: 10.2312/SGP/SGP05/207-216
Establishing a correspondence between two surfaces is a basic ingredient in many geometry processing applications. Existing approaches, which attempt to match two meshes directly in 3D, can be cumbersome to implement and it is often hard to produce accurate results in a reasonable amount of time. In this paper, we present a new variational method for matching surfaces that addresses these issues. Instead of matching two surfaces directly in 3D, we apply well-established matching methods from image processing in the parameter domains of the surfaces. A matching energy is introduced that can depend on curvature, feature demarcations or surface textures, and a regularization energy controls length and area changes in the induced non-rigid deformation between the two surfaces. The metric on both surfaces is properly incorporated into the formulation of the energy. This approach reduces all computations to the 2D setting while accounting for the original geometries. Consequently a fast multiresolution numerical algorithm for regular image grids can be used to solve the global optimization problem. The final algorithm is robust, generically much simpler than direct matching methods, and very fast for highly resolved triangle meshes.https://authors.library.caltech.edu/records/0tj9s-zwe89Sparse Matrix Solvers on the GPU: Conjugate Gradients and Multigrid
https://resolver.caltech.edu/CaltechAUTHORS:20160725-161316334
Authors: {'items': [{'id': 'Bolz-J', 'name': {'family': 'Bolz', 'given': 'Jeff'}}, {'id': 'Farmer-I', 'name': {'family': 'Farmer', 'given': 'Ian'}}, {'id': 'Grinspun-E', 'name': {'family': 'Grinspun', 'given': 'Eitan'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2005
DOI: 10.1145/1198555.1198781
Many computer graphics applications require high-intensity numerical simulation. We show that such computations can be performed efficiently on the GPU, which we regard as a full function streaming processor with high floating-point performance. We implemented two basic, broadly useful, computational kernels: a sparse matrix conjugate gradient solver and a regular-grid multigrid solver. Real-time applications ranging from mesh smoothing and parameterization to fluid solvers and solid mechanics can greatly benefit from these, evidence our example applications of geometric flow and fluid simulation running on NVIDIA's GeForce FX.https://authors.library.caltech.edu/records/eq00s-hq297Geometric, Variational Integrators for Computer Animation
https://resolver.caltech.edu/CaltechAUTHORS:20101005-093706360
Authors: {'items': [{'id': 'Kharevych-L', 'name': {'family': 'Kharevych', 'given': 'L.'}}, {'id': 'Wei-W', 'name': {'family': 'Wei', 'given': 'W.'}}, {'id': 'Tong-Y', 'name': {'family': 'Tong', 'given': 'Y.'}}, {'id': 'Kanso-E', 'name': {'family': 'Kanso', 'given': 'E.'}}, {'id': 'Marsden-J-E', 'name': {'family': 'Marsden', 'given': 'J. E.'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'P.'}, 'orcid': '0000-0002-0323-7674'}, {'id': 'Desbrun-M', 'name': {'family': 'Desbrun', 'given': 'M.'}, 'orcid': '0000-0003-3424-6079'}]}
Year: 2006
We present a general-purpose numerical scheme for time integration of Lagrangian dynamical systems—an important
computational tool at the core of most physics-based animation techniques. Several features make this
particular time integrator highly desirable for computer animation: it numerically preserves important invariants,
such as linear and angular momenta; the symplectic nature of the integrator also guarantees a correct energy
behavior, even when dissipation and external forces are added; holonomic constraints can also be enforced quite
simply; finally, our simple methodology allows for the design of high-order accurate schemes if needed. Two key
properties set the method apart from earlier approaches. First, the nonlinear equations that must be solved during
an update step are replaced by a minimization of a novel functional, speeding up time stepping by more than a
factor of two in practice. Second, the formulation introduces additional variables that provide key flexibility in the
implementation of the method. These properties are achieved using a discrete form of a general variational principle
called the Pontryagin-Hamilton principle, expressing time integration in a geometric manner. We demonstrate
the applicability of our integrators to the simulation of non-linear elasticity with implementation details.https://authors.library.caltech.edu/records/nsh6p-s5d70What can we measure?
https://resolver.caltech.edu/CaltechAUTHORS:20161215-162318208
Authors: {'items': [{'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2006
DOI: 10.1145/1185657.1185660
When characterizing a shape or changes in shape we must first ask, what can we measure about a shape? For example, for a region in ℝ^3 we may ask for its volume or its surface area. If the object at hand undergoes deformation due to forces acting on it we may need to formulate the laws governing the change in shape in terms of measurable quantities and their change over time. Usually such measurable quantities for a shape are defined with the help of integral calculus and often require some amount of smoothness on the object to be well defined. In this chapter we will take a more abstract approach to the question of measurable quantities which will allow us to define notions such as mean curvature integrals and the curvature tensor for piecewise linear meshes without having to worry about the meaning of second derivatives in settings in which they do not exist. In fact in this chapter we will give an account of a classical result due to Hadwiger, which shows that for a convex, compact set in ℝ^n there are only n + 1 unique measurements if we require that the measurements be invariant under Euclidian motions (and satisfy certain "sanity" conditions). We will see how these measurements are constructed in a very straightforward and elementary manner and that they can be read off from a characteristic polynomial due to Steiner. This polynomial describes the volume of a family of shapes which arise when we "grow" a given shape. As a practical tool arising from these consideration we will see that there is a well defined notion of the curvature tensor for piecewise linear meshes and we will see very simple formulas for quantities needed in physical simulation with piecewise linear meshes. Much of the treatment here will be limited to convex
bodies to keep things simple.https://authors.library.caltech.edu/records/djww5-zfy81Stable, circulation-preserving, simplicial fluids
https://resolver.caltech.edu/CaltechAUTHORS:20161013-131839051
Authors: {'items': [{'id': 'Elcott-S', 'name': {'family': 'Elcott', 'given': 'Sharif'}}, {'id': 'Tong-Yiying', 'name': {'family': 'Tong', 'given': 'Yiying'}}, {'id': 'Kanso-E', 'name': {'family': 'Kanso', 'given': 'Eva'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}, {'id': 'Desbrun-M', 'name': {'family': 'Desbrun', 'given': 'Mathieu'}, 'orcid': '0000-0003-3424-6079'}]}
Year: 2006
DOI: 10.1145/1185657.1185667
Visual quality, low computational cost, and numerical stability are foremost goals in computer animation. An important ingredient in achieving these goals is the conservation of fundamental motion invariants. For example, rigid and deformable body simulation benefits greatly from conservation of linear and angular momenta. In the case of fluids, however, none of the current techniques focuses on conserving invariants, and consequently, they often introduce a visually disturbing numerical diffusion of vorticity. Visually just as important is the resolution of complex simulation domains. Doing so with regular (even if adaptive) grid techniques can be computationally delicate. In this chapter, we propose a novel technique for the simulation of fluid flows. It is designed to respect the defining differential properties, i.e., the conservation of circulation along arbitrary loops as they are transported by the flow. Consequently, our method offers several new and desirable properties: (1) arbitrary simplicial meshes (triangles in 2D, tetrahedra in 3D) can be used to define the fluid domain; (2) the computations are efficient due to discrete operators with small support; (3) the method is stable for arbitrarily large time steps; (4) it preserves discrete circulation avoiding numerical diffusion of vorticity; and (5) its implementation is straightforward.https://authors.library.caltech.edu/records/nad7m-5bz38Building your own DEC at home
https://resolver.caltech.edu/CaltechAUTHORS:20161011-164535652
Authors: {'items': [{'id': 'Elcott-S', 'name': {'family': 'Elcott', 'given': 'Sharif'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2006
DOI: 10.1145/1185657.1185666
The methods of Discrete Exterior Calculus (DEC) have given birth to many new algorithms applicable to areas such as fluid simulation, deformable body simulation, and others. Despite the (possibly intimidating) mathematical theory that went into deriving these algorithms, in the end they lead to simple, elegant, and straightforward implementations. However, readers interested in implementing
them should note that the algorithms presume the existence
of a suitable simplicial complex data structure. Such a data
structure needs to support local traversal of elements, adjacency information for all dimensions of simplices, a notion of a dual mesh, and all simplices must be oriented. Unfortunately, most publicly available tetrahedral mesh libraries provide only unoriented representations
with little more than vertex-tet adjacency information
(while we need vertex-edge, edge-triangle, edge-tet, etc.). For those eager to implement and build on the algorithms presented in this course without having to worry about these details, we provide an implementation of a DEC-friendly tetrahedral mesh data structure
in C++. This chapter documents the ideas behind the implementation.https://authors.library.caltech.edu/records/s5x80-k2a68An algorithm for the construction of intrinsic Delaunay triangulations with applications to digital geometry processing
https://resolver.caltech.edu/CaltechAUTHORS:20161019-160617640
Authors: {'items': [{'id': 'Fisher-Matthew-David-CompSci', 'name': {'family': 'Fisher', 'given': 'Matthew'}, 'orcid': '0000-0002-8908-3417'}, {'id': 'Springborn-B', 'name': {'family': 'Springborn', 'given': 'Boris'}}, {'id': 'Bobenko-A-I', 'name': {'family': 'Bobenko', 'given': 'Alexander I.'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2006
DOI: 10.1145/1185657.1185668
The discrete Laplace-Beltrami operator plays a prominent role in many Digital Geometry Processing applications ranging from denoising to parameterization, editing, and physical simulation. The standard discretization uses the cotangents of the angles in the immersed mesh which leads to a variety of numerical problems. We advocate use of the
intrinsic Laplace-Beltrami operator. It satisfies a local maximum principle, guaranteeing, e.g., that no flipped
triangles can occur in parameterizations. It also leads to better conditioned linear systems. The intrinsic Laplace-Beltrami operator is based on an intrinsic
Delaunay triangulation of the surface. We give
an incremental algorithm to construct such triangulations together with an overlay structure which captures the relationship between the extrinsic and intrinsic triangulations. Using a variety of example meshes we demonstrate the numerical benefits of the intrinsic
Laplace-Beltrami operator.https://authors.library.caltech.edu/records/1cg4x-t0880Edge subdivision schemes and the construction of smooth vector fields
https://resolver.caltech.edu/CaltechAUTHORS:20170104-161620229
Authors: {'items': [{'id': 'Wang-Ke', 'name': {'family': 'Wang', 'given': 'Ke'}}, {'id': 'Weiwei-', 'name': {'family': 'Weiwei'}}, {'id': 'Tong-Yiying', 'name': {'family': 'Tong', 'given': 'Yiying'}}, {'id': 'Desbrun-M', 'name': {'family': 'Desbrun', 'given': 'Mathieu'}, 'orcid': '0000-0003-3424-6079'}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2006
DOI: 10.1145/1179352.1141991
Vertex- and face-based subdivision schemes are now routinely used in geometric modeling and computational science, and their primal/dual relationships are well studied. In this paper, we interpret these schemes as defining bases for discrete differential 0- resp. 2-forms, and complete the picture by introducing edge-based subdivision schemes to construct the missing bases for discrete differential 1-forms. Such subdivision schemes map scalar coefficients on edges from the coarse to the refined mesh and are intrinsic to the surface. Our construction is based on treating vertex-, edge-, and face-based subdivision schemes as a joint triple and enforcing that subdivision commutes with the topological exterior derivative. We demonstrate our construction for the case of arbitrary topology triangle meshes. Using Loop's scheme for 0-forms and generalized half-box splines for 2-forms results in a unique generalized spline scheme for 1-forms, easily incorporated into standard subdivision surface codes. We also provide corresponding boundary stencils. Once a metric is supplied, the scalar 1-form coefficients define a smooth tangent vector field on the underlying subdivision surface. Design of tangent vector fields is made particularly easy with this machinery as we demonstrate.https://authors.library.caltech.edu/records/rw6cz-hh755Design of tangent vector fields
https://resolver.caltech.edu/CaltechAUTHORS:20161019-155301872
Authors: {'items': [{'id': 'Fisher-Matthew-David-CompSci', 'name': {'family': 'Fisher', 'given': 'Matthew'}, 'orcid': '0000-0002-8908-3417'}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}, {'id': 'Desbrun-M', 'name': {'family': 'Desbrun', 'given': 'Mathieu'}, 'orcid': '0000-0003-3424-6079'}, {'id': 'Hoppe-Hugues', 'name': {'family': 'Hoppe', 'given': 'Hugues'}, 'orcid': '0000-0002-9699-2539'}]}
Year: 2007
DOI: 10.1145/1275808.1276447
Tangent vector fields are an essential ingredient in controlling surface appearance for applications ranging from anisotropic shading to texture synthesis and non-photorealistic rendering. To achieve a desired effect one is typically interested in smoothly varying fields that satisfy a sparse set of user-provided constraints. Using tools from Discrete Exterior Calculus, we present a simple
and efficient algorithm for designing such fields over arbitrary triangle meshes. By representing the field as scalars over mesh edges (i.e., discrete 1-forms), we obtain an intrinsic, coordinate-free formulation in which field smoothness is enforced through discrete Laplace operators. Unlike previous methods, such a formulation leads to a linear system whose sparsity permits efficient
pre-factorization. Constraints are incorporated through weighted least squares and can be updated rapidly enough to enable interactive design, as we demonstrate in the context of anisotropic texture synthesis.https://authors.library.caltech.edu/records/rmh81-z3w27Conformal equivalence of triangle meshes
https://resolver.caltech.edu/CaltechAUTHORS:20161220-135710541
Authors: {'items': [{'id': 'Springborn-B', 'name': {'family': 'Springborn', 'given': 'Boris'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}, {'id': 'Pinkall-U', 'name': {'family': 'Pinkall', 'given': 'Ulrich'}}]}
Year: 2008
DOI: 10.1145/1399504.1360676
We present a new algorithm for conformal mesh parameterization. It is based on a precise notion of discrete conformal equivalence for triangle meshes which mimics the notion of conformal equivalence for smooth surfaces. The problem of finding a flat mesh that is discretely conformally equivalent to a given mesh can be solved efficiently by minimizing a convex energy function, whose Hessian turns out to be the well known cot-Laplace operator. This method can also be used to map a surface mesh to a parameter domain which is flat except for isolated cone singularities, and we show how these can be placed automatically in order to reduce the distortion of the parameterization. We present the salient features of the theory and elaborate the algorithms with a number of examples.https://authors.library.caltech.edu/records/3jr66-h6j47A Simple Geometric Model for Elastic Deformations
https://resolver.caltech.edu/CaltechAUTHORS:20160819-110910323
Authors: {'items': [{'id': 'Chao-Isaac', 'name': {'family': 'Chao', 'given': 'Isaac'}}, {'id': 'Pinkall-U', 'name': {'family': 'Pinkall', 'given': 'Ulrich'}}, {'id': 'Sanan-P', 'name': {'family': 'Sanan', 'given': 'Patrick'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2010
DOI: 10.1145/1833349.1778775
We advocate a simple geometric model for elasticity: distance between the differential of a deformation and the rotation group. It comes with rigorous differential geometric underpinnings, both smooth and discrete, and is computationally almost as simple and efficient as linear elasticity. Owing to its geometric non-linearity,
though, it does not suffer from the usual linearization artifacts. A material model with standard elastic moduli (Lamé parameters) falls out naturally, and a minimizer for static problems is easily augmented to construct a fully variational 2nd order time integrator. It has excellent conservation properties even for very coarse
simulations, making it very robust.
Our analysis was motivated by a number of heuristic, physics-like algorithms from geometry processing (editing, morphing, parameterization, and simulation). Starting with a continuous energy formulation and taking the underlying geometry into account, we simplify and accelerate these algorithms while avoiding common pitfalls. Through the connection with the Biot strain of mechanics, the intuition of previous work that these ideas are "like" elasticity is shown to be spot on.https://authors.library.caltech.edu/records/ybmfn-rqw41Spin transformations of discrete surfaces
https://resolver.caltech.edu/CaltechAUTHORS:20161005-155130201
Authors: {'items': [{'id': 'Crane-K', 'name': {'family': 'Crane', 'given': 'Keenan'}}, {'id': 'Pinkall-U', 'name': {'family': 'Pinkall', 'given': 'Ulrich'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2011
DOI: 10.1145/1964921.1964999
We introduce a new method for computing conformal transformations of triangle meshes in ℝ^3. Conformal maps are desirable in digital geometry processing because they do not exhibit shear, and therefore preserve texture fidelity as well as the quality of the mesh itself. Traditional discretizations consider maps into the
complex plane, which are useful only for problems such as surface parameterization and planar shape deformation where the target surface is flat. We instead consider maps into the quaternions H, which allows us to work directly with surfaces sitting in ℝ^3. In particular, we introduce a
quaternionic Dirac operator and use it to develop a novel integrability condition on conformal deformations. Our discretization of this condition results in a
sparse linear system that is simple to build and can be used to efficiently edit surfaces by manipulating curvature and boundary data, as demonstrated via several mesh processing applications.https://authors.library.caltech.edu/records/75r74-39v92√3-Based 1-Form Subdivision
https://resolver.caltech.edu/CaltechAUTHORS:20120725-131858923
Authors: {'items': [{'id': 'Huang-Jinghao', 'name': {'family': 'Huang', 'given': 'Jinghao'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2012
DOI: 10.1007/978-3-642-27413-8_22
In this paper we construct an edge based, or 1-form, subdivision scheme consistent with √3 subdivision. It produces smooth differential 1-forms in the limit. These can be identified with tangent vector fields, or viewed as edge elements in the sense of finite elements. In this construction, primal (0-form) and dual (2-form) subdivision schemes for surfaces are related through the exterior derivative with an edge (1-form) based subdivision scheme, amounting to a generalization of the well known formulé de commutation.
Starting with the classic √3 subdivision scheme as a 0-form subdivision scheme, we derive conditions for appropriate 1- and 2-form subdivision schemes without fixing the dual (2-form) subdivision scheme a priori. The resulting degrees of freedom are resolved through spectrum considerations and a conservation condition analogous to the usual moment
condition for primal subdivision schemes.https://authors.library.caltech.edu/records/vp6wy-fzh35Digital geometry processing with discrete exterior calculus
https://resolver.caltech.edu/CaltechAUTHORS:20131008-161552884
Authors: {'items': [{'id': 'Crane-Keenan', 'name': {'family': 'Crane', 'given': 'Keenan'}}, {'id': 'de-Goes-Fernando', 'name': {'family': 'de Goes', 'given': 'Fernando'}}, {'id': 'Desbrun-M', 'name': {'family': 'Desbrun', 'given': 'Mathieu'}, 'orcid': '0000-0003-3424-6079'}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2013
DOI: 10.1145/2504435.2504442
These notes provide an introduction to working with real-world geometric data, expressed
in the language of discrete exterior calculus (DEC). DEC is a simple, flexible, and efficient framework
which provides a unified platform for geometry processing. The notes provide essential
mathematical background as well as a large array of real-world examples, with an emphasis on
applications and implementation. The material should be accessible to anyone with some exposure
to basic linear algebra and vector calculus, though most of the key concepts are reviewed as needed.
Coding exercises depend on a basic knowledge of C++, though knowledge of any programming
language is likely sufficient: we do not make heavy use of paradigms like inheritance, templates,
etc. The notes also provide guided written exercises that can be used to deepen understanding of
the material.https://authors.library.caltech.edu/records/em1fn-3b721Tree Shape Priors with Connectivity Constraints Using Convex Relaxation on General Graphs
https://resolver.caltech.edu/CaltechAUTHORS:20230210-663266000.1
Authors: {'items': [{'id': 'Stühmer-Jan', 'name': {'family': 'Stühmer', 'given': 'Jan'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}, {'id': 'Cremers-Daniel', 'name': {'family': 'Cremers', 'given': 'Daniel'}, 'orcid': '0000-0002-3079-7984'}]}
Year: 2013
DOI: 10.1109/iccv.2013.290
In this work we propose a novel method to include a connectivity prior into image segmentation that is based on a binary labeling of a directed graph, in this case a geodesic shortest path tree. Specifically we make two contributions: First, we construct a geodesic shortest path tree with a distance measure that is related to the image data and the bending energy of each path in the tree. Second, we include a connectivity prior in our segmentation model, that allows to segment not only a single elongated structure, but instead a whole connected branching tree. Because both our segmentation model and the connectivity constraint are convex a global optimal solution can be found. To this end, we generalize a recent primal-dual algorithm for continuous convex optimization to an arbitrary graph structure. To validate our method we present results on data from medical imaging in angiography and retinal blood vessel segmentation.https://authors.library.caltech.edu/records/mcpgt-ayd62Fitting subdivision surfaces
https://resolver.caltech.edu/CaltechAUTHORS:20230210-463137000.2
Authors: {'items': [{'id': 'Litke-Nathan', 'name': {'family': 'Litke', 'given': 'Nathan'}}, {'id': 'Levin-Adi', 'name': {'family': 'Levin', 'given': 'Adi'}}, {'id': 'Schröder-P', 'name': {'family': 'Schröder', 'given': 'Peter'}, 'orcid': '0000-0002-0323-7674'}]}
Year: 2023
DOI: 10.1109/visual.2001.964527
We introduce a new algorithm for fitting a Catmull-Clark subdivision surface to a given shape within a prescribed tolerance, based on the method of quasi-interpolation. The fitting algorithm is fast, local and scales well since it does not require the solution of linear systems. Its convergence rate is optimal for regular meshes and our experiments show that it behaves very well for irregular meshes. We demonstrate the power and versatility of our method with examples from interactive modeling, surface fitting, and scientific visualization.https://authors.library.caltech.edu/records/tm0ke-g1c61