32-Issue 2

Permanent URI for this collection

https://diglib.eg.org/handle/10.2312/180

Browse

Now showing 1 - 14 of 14

Bilateral Hermite Radial Basis Functions for Contour-based Volume Segmentation
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Ijiri, Takashi; Yoshizawa, Shin; Sato, Yu; Ito, Masaaki; Yokota, Hideo; I. Navazo, P. Poulin
In this paper, we propose a novel contour-based volume image segmentation technique. Our technique is based on an implicit surface reconstruction strategy, whereby a signed scalar field is generated from user-specified contours. The key idea is to compute the scalar field in a joint spatial-range domain (i.e., bilateral domain) and resample its values on an image manifold. We introduce a new formulation of Hermite radial basis function (HRBF) interpolation to obtain the scalar field in the bilateral domain. In contrast to previous implicit methods, bilateral HRBF (BHRBF) generates a segmentation boundary that passes through all contours, fits high-contrast image edges if they exist, and has a smooth shape in blurred areas of images. We also propose an acceleration scheme for computing B-HRBF to support a real-time and intuitive segmentation interface. In our experiments, we achieved high-quality segmentation results for regions of interest with high-contrast edges and blurred boundaries.
Circular Arc Snakes and Kinematic Surface Generation
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Barton, Michael; Shi, Ling; Kilian, Martin; Wallner, Johannes; Pottmann, Helmut; I. Navazo, P. Poulin
We discuss the theory, discretization, and numerics of curves which are evolving such that part of their shape, or at least their curvature as a function of arc length, remains unchanged. The discretization of a curve as a smooth sequence of circular arcs is well suited for such purposes, and allows us to reduce evolution of curves to the evolution of a control point collection in a certain finite-dimensional shape space. We approach this evolution by a 2-step process: linearized evolution via optimized velocity fields, followed by optimization in order to exactly fulfill all geometric side conditions. We give applications to freeform architecture, including ''rationalization'' of a surface by congruent arcs, form finding and, most interestingly, non-static architecture.
A Correlated Parts Model for Object Detection in Large 3D Scans
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Sunkel, Martin; Jansen, Silke; Wand, Michael; Seidel, Hans-Peter; I. Navazo, P. Poulin
This paper addresses the problem of detecting objects in 3D scans according to object classes learned from sparse user annotation. We model objects belonging to a class by a set of fully correlated parts, encoding dependencies between local shapes of different parts as well as their relative spatial arrangement. For an efficient and comprehensive retrieval of instances belonging to a class of interest, we introduce a new approximate inference scheme and a corresponding planning procedure. We extend our technique to hierarchical composite structures, reducing training effort and modeling spatial relations between detected instances. We evaluate our method on a number of real-world 3D scans and demonstrate its benefits as well as the performance of the new inference algorithm.
Coupled Quasi-harmonic Bases
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Kovnatsky, Artiom; Bronstein, Michael M.; Bronstein, Alexander M.; Glashoff, Klaus; Kimmel, Ron; I. Navazo, P. Poulin
The use of Laplacian eigenbases has been shown to be fruitful in many computer graphics applications. Today, state-of-the-art approaches to shape analysis, synthesis, and correspondence rely on these natural harmonic bases that allow using classical tools from harmonic analysis on manifolds. However, many applications involving multiple shapes are obstacled by the fact that Laplacian eigenbases computed independently on different shapes are often incompatible with each other. In this paper, we propose the construction of common approximate eigenbases for multiple shapes using approximate joint diagonalization algorithms, taking as input a set of corresponding functions (e.g. indicator functions of stable regions) on the two shapes. We illustrate the benefits of the proposed approach on tasks from shape editing, pose transfer, correspondence, and similarity.
Exploring Local Modifications for Constrained Meshes
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Deng, Bailin; Bouaziz, Sofien; Deuss, Mario; Zhang, Juyong; Schwartzburg, Yuliy; Pauly, Mark; I. Navazo, P. Poulin
Mesh editing under constraints is a challenging task with numerous applications in geometric modeling, industrial design, and architectural form finding. Recent methods support constraint-based exploration of meshes with fixed connectivity, but commonly lack local control. Because constraints are often globally coupled, a local modification by the user can have global effects on the surface, making iterative design exploration and refinement difficult. Simply fixing a local region of interest a priori is problematic, as it is not clear in advance which parts of the mesh need to be modified to obtain an aesthetically pleasing solution that satisfies all constraints. We propose a novel framework for exploring local modifications of constrained meshes. Our solution consists of three steps. First, a user specifies target positions for one or more vertices. Our algorithm computes a sparse set of displacement vectors that satisfies the constraints and yields a smooth deformation. Then we build a linear subspace to allow realtime exploration of local variations that satisfy the constraints approximately. Finally, after interactive exploration, the result is optimized to fully satisfy the set of constraints. We evaluate our framework on meshes where each face is constrained to be planar.
Fabrication-aware Design with Intersecting Planar Pieces
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Schwartzburg, Yuliy; Pauly, Mark; I. Navazo, P. Poulin
We propose a computational design approach to generate 3D models composed of interlocking planar pieces. We show how intricate 3D forms can be created by sliding the pieces into each other along straight slits, leading to a simple construction that does not require glue, screws, or other means of support. To facilitate the design process, we present an abstraction model that formalizes the main geometric constraints imposed by fabrication and assembly, and incorporates conditions on the rigidity of the resulting structure.We show that the tight coupling of constraints makes manual design highly nontrivial and introduce an optimization method to automate constraint satisfaction based on an analysis of the constraint relation graph. This algorithm ensures that the planar parts can be fabricated and assembled. We demonstrate the versatility of our approach by creating 3D toy models, an architectural design study, and several examples of functional furniture.
Fleshing: Spine-driven Bending with Local Volume Preservation
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Zhuo, Wei; Rossignac, Jarek; I. Navazo, P. Poulin
Several design and animation techniques use a one-dimensional proxyC (a spine curve in 3D) to control the deformation or behavior of a digital model of a 3D shape S. We propose a modification of these ''skinning'' techniques that ensures local volume preservation, which is important for the physical plausibility of digital simulations. In the proposed ''fleshing'' techniques, as input, we consider a smooth spine C0, a model S0 of a solid that lies ''sufficiently close'' to C0, and a deformed version C1 of C0 that is ''not overly bent''. (We provide a precise characterization of these restrictions.) As output, we produce a bijective mapping M, that maps any point X of S onto a point M(X) of M(S). M satisfies two properties: (1) The closest projection of X on C0 and of M(X) on C1 have the same arc length parameter. (2) U and M(U) have the same volume, where U is any subset of S. We provide three different closed form expressions for radial, normal and binormal fleshing and discuss the details of their practical real-time implementation.
Geometry-Aware Volume-of-Fluid Method
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Cho, Junghyun; Ko, Hyeong-Seok; I. Navazo, P. Poulin
We present a new framework to simulate moving interfaces in viscous incompressible two phase flows. The goal is to achieve both conservation of the fluid volume and a detailed reconstruction of the fluid surface. To these ends, we incorporate sub-grid refinement of the level set with the volume-of-fluid method. In the context of this refined level set grid we propose the algorithms needed for the coupling of the level set and the volume-of-fluid, which include techniques for computing volume, redistancing the level set, and handling surface tension. We report the experimental results produced with the proposed method via simulations of the two phase fluid phenomena such as air-cushioning and deforming large bubbles.
Global Selection of Stream Surfaces
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Esturo, Janick Martinez; Schulze, Maik; Rössl, Christian; Theisel, Holger; I. Navazo, P. Poulin
Stream surfaces are well-known and widely-used structures for 3D flow visualization. A single surface can be sufficient to represent important global flow characteristics. Unfortunately, due to the huge space of possible stream surfaces, finding the globally most representative stream surface turns out to be a hard task that is usually performed by time-consuming manual trial and error exploration using slight modifications of seed geometries. To assist users we propose a new stream surface selection method that acts as an automatic preprocessing step before data analysis. We measure stream surface relevance by a novel surface-based quality measure that prefers surfaces where the flow is aligned with principal curvature directions. The problem of seed structure selection can then be reduced to the computation of simple minimal paths in a weighted graph spanning the domain. We apply a simulated annealing-based optimization method to find smooth seed curves of globally near-optimal stream surfaces. We illustrate the effectiveness of our method on a series of synthetic and real-world data sets.
Landmark-Guided Elastic Shape Analysis of Spherically-Parameterized Surfaces
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Kurtek, Sebastian; Srivastava, Anuj; Klassen, Eric; Laga, Hamid; I. Navazo, P. Poulin
We argue that full surface correspondence (registration) and optimal deformations (geodesics) are two related problems and propose a framework that solves them simultaneously. We build on the Riemannian shape analysis of anatomical and star-shaped surfaces of Kurtek et al. and focus on articulated complex shapes that undergo elastic deformations and that may contain missing parts. Our core contribution is the re-formulation of Kurtek et al.'s approach as a constrained optimization over all possible re-parameterizations of the surfaces, using a sparse set of corresponding landmarks. We introduce a landmark-constrained basis, which we use to numerically solve this optimization and therefore establish full surface registration and geodesic deformation between two surfaces. The length of the geodesic provides a measure of dissimilarity between surfaces. The advantages of this approach are: (1) simultaneous computation of full correspondence and geodesic between two surfaces, given a sparse set of matching landmarks (2) ability to handle more comprehensive deformations than nearly isometric, and (3) the geodesics and the geodesic lengths can be further used for symmetrizing 3D shapes and for computing their statistical averages. We validate the framework on challenging cases of large isometric and elastic deformations, and on surfaces with missing parts. We also provide multiple examples of averaging and symmetrizing 3D models.
Mutable Elastic Models for Sculpting Structured Shapes
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Milliez, Antoine; Wand, Michael; Cani, Marie-Paule; Seidel, Hans-Peter; I. Navazo, P. Poulin
In this paper, we propose a new paradigm for free-form shape deformation. Standard deformable models minimize an energy measuring the distance to a single target shape. We propose a new, ''mutable'' elastic model. It represents complex geometry by a collection of parts and measures the distance of each part measures to a larger set of alternative rest configurations. By detecting and reacting to local switches between best-matching rest states, we build a 3D sculpting system: It takes a structured shape consisting of parts and replacement rules as input. The shape can subsequently be elongated, compressed, bent, cut, and merged within a constraints-based free-form editing interface, where alternative rest-states model to such changes. In practical experiments, we show that the approach yields a surprisingly intuitive and easy to implement interface for interactively designing objects described by such discrete shape grammars, for which direct shape control mechanisms were typically lacking.
A Particle-Grid Method for Opaque Ice Formation
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Im, Jaeho; Park, Hanwook; Kim, Jong-Hyun; Kim, Chang-Hun; I. Navazo, P. Poulin
This paper presents a particle-grid method to simulate the generation of opaque ice which has air bubbles in it. Water temperature is diffused over a grid, and the exchange of dissolved air between ice and water particles is simulated. We render a particle as an air bubble if it has sufficient air. Otherwise, it is treated as a cloudy volume by distributing air into dissolved air field when the final state has been reached. In addition, our method includes a model in which heat transfer rate may change across the grid. Unlike previous models which could generate an ice volume of only fixed shapes, our approach uses signed distance function (SDF) to generate opaque ice volumes stored in containers of various geometric shapes and can render needle-shaped or egg-shaped bubbles.
Primitive Trees for Precomputed Distance Queries
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Lee, Sung-Ho; Park, Taejung; Kim, Chang-Hun; I. Navazo, P. Poulin
We propose the primitive tree, a novel and compact space-partition method that samples and reconstructs a distance field with high accuracy, even for regions far from the surfaces. The primitive tree is based on the octree and stores the indices of the nearest primitives in its leaf nodes. Most previous approaches have involved a trade-off between accuracy and speed in distance queries, but our method can improve both aspects simultaneously. In addition, our method can sample unsigned distance fields effectively, even for self-intersecting and nonmanifold models. We present test results showing that our method can sample and represent large scenes, with more than ten million triangles, rapidly and accurately.
Sifted Disks
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Ebeida, Mohamed S.; Mahmoud, Ahmed H.; Awad, Muhammad A.; Mohammed, Mohammed A.; Mitchell, Scott A.; Rand, Alexander; Owens, John D.; I. Navazo, P. Poulin
We introduce the Sifted Disk technique for locally resampling a point cloud in order to reduce the number of points. Two neighboring points are removed and we attempt to find a single random point that is sufficient to replace them both. The resampling respects the original sizing function; In that sense it is not a coarsening. The angle and edge length guarantees of a Delaunay triangulation of the points are preserved. The sifted point cloud is still suitable for texture synthesis because the Fourier spectrum is largely unchanged. We provide an efficient algorithm, and demonstrate that sifting uniform Maximal Poisson-disk Sampling (MPS) and Delaunay Refinement (DR) points reduces the number of points by about 25 percent, and achieves a density about 1/3 more than the theoretical minimum. We show two-dimensional stippling and meshing applications to demonstrate the significance of the concept.

Browse

Browsing 32-Issue 2 by Subject "Computational Geometry and Object Modeling"

Results Per Page

Sort Options