Results 1  10
of
47
ReTiling Polygonal Surfaces
 Computer Graphics
, 1992
"... This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at various levels of detail is important for achieving high frame rates in interactive graphics applications and also for speed ..."
Abstract

Cited by 402 (2 self)
 Add to MetaCart
This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at various levels of detail is important for achieving high frame rates in interactive graphics applications and also for speedingup the offline rendering of complex scenes. Unfortunately, generating these levels of detail is a timeconsuming task usually left to a human modeler. This paper shows how a new set of vertices can be distributed over the surface of a model and connected to one another to create a retiling of a surface that is faithful to both the geometry and the topology of the original surface. Themain contributions of this paper are: 1) a robust method of connecting together new vertices over a surface, 2) a way of using an estimate of surface curvature to distribute more new vertices at regions of higher curvature and 3) a method of smoothly interpolating between models that represent the same object at different levels of detail. The key notion in the retiling procedure is the creation of an intermediate model called the mutual tessellation of a surface that contains both the vertices from the original model and the new points that are to become vertices in the retiled surface. The new model is then created by removing each original vertex and locally retriangulating the surface in a way that matches the local connectedness of the initial surface. This technique for surface retessellation has been successfully applied to isosurface models derived from volume data, Connolly surface molecular models and a tessellation of a minimal surface of interest to mathematicians. CRCategoriesandSubjectDescriptors: I.3.3 [ComputerGraph ics]: Picture/Image Generation  Display algorithms
Generating textures on arbitrary surfaces using reactiondiffusion
 Computer Graphics
, 1991
"... This paper describes a biologically motivated method of texture synthesis called reactiondiffusion and demonstrates how these textures can be generated in a manner that directly matches the geometry of a given surface. Reactiondiffusion is a process in which two or more chemicals diffuse at unequa ..."
Abstract

Cited by 229 (5 self)
 Add to MetaCart
This paper describes a biologically motivated method of texture synthesis called reactiondiffusion and demonstrates how these textures can be generated in a manner that directly matches the geometry of a given surface. Reactiondiffusion is a process in which two or more chemicals diffuse at unequal rates over a surface and react with one another to form stable patterns such as spots and stripes. Biologists and mathematicians have explored the patterns made by several reactiondiffusion systems. We extend the range of textures that have previously been generated by using a cascade of multiple reactiondiffusion systems in which one system lays down an initial pattern and then one or more later systems refine the pattern. Examples of patterns generated by such a cascade process include the clusters of spots on leopards known as rosettes and the weblike patterns found on giraffes. In addition, this paper introduces a method by which reactiondiffusion textures are created to match the geometry of an arbitrary polyhedral surface. This is accomplished by creating a mesh over a given surface and then simulating the reactiondiffusion process directly on this mesh. This avoids the often difficult task of assigning texture coordinates to a complex surface. A mesh is generated by evenly distributing points over the model using relaxation and then determining which points are adjacent by constructing their Voronoi regions. Textures are rendered directly from the mesh by using a weighted sum of mesh values to compute surface color at a given position. Such textures can also be used as bump maps.
Mesh Generation And Optimal Triangulation
, 1992
"... We survey the computational geometry relevant to finite element mesh generation. We especially focus on optimal triangulations of geometric domains in two and threedimensions. An optimal triangulation is a partition of the domain into triangles or tetrahedra, that is best according to some cri ..."
Abstract

Cited by 180 (8 self)
 Add to MetaCart
We survey the computational geometry relevant to finite element mesh generation. We especially focus on optimal triangulations of geometric domains in two and threedimensions. An optimal triangulation is a partition of the domain into triangles or tetrahedra, that is best according to some criterion that measures the size, shape, or number of triangles. We discuss algorithms both for the optimization of triangulations on a fixed set of vertices and for the placement of new vertices (Steiner points). We briefly survey the heuristic algorithms used in some practical mesh generators.
Bubble Mesh: Automated Triangular Meshing of NonManifold Geometry by Sphere Packing
 ACM SYMPOSIUM ON SOLID MODELING AND APPLICATIONS
, 1995
"... This paper presents a new computational method for fully automated triangular mesh generation, consistently applicable to wireframe, surface, solid, and nonmanifold geometries. The method, called bubble meshing, is based on the observation that a pattern of tightly packed spheres mimics a Voronoi d ..."
Abstract

Cited by 56 (11 self)
 Add to MetaCart
This paper presents a new computational method for fully automated triangular mesh generation, consistently applicable to wireframe, surface, solid, and nonmanifold geometries. The method, called bubble meshing, is based on the observation that a pattern of tightly packed spheres mimics a Voronoi diagram, from which a set of wellshaped Delaunay triangles and tetrahedra can be created by connecting the centers of the spheres. Given a domain geometry and a nodespacing function, spheres are packed on geometric entities, namely, vertices, edges, faces, and volumes, in ascending order of dimension. Once the domain is filled with spheres, mesh nodes are placed at the centers of these spheres and are then connected by constrained Delaunay triangulation and tetrahedrization. To obtain a closely packed configuration of spheres, the authors devised a technique for physically based mesh relaxation with adaptive population control. The process of mesh relaxation significantly reduces the number of illshaped triangles and tetrahedra.
Flipping Edges on Triangulations
, 1996
"... In this paper we study the problem of flipping edges in triangulations of polygons and point sets. We prove that if a polygon Q n has k reflex vertices, then any triangulation of Q n can be transformed to another triangulation of Q n with at most O(n + k 2 ) flips. We produce examples of polygons ..."
Abstract

Cited by 39 (7 self)
 Add to MetaCart
In this paper we study the problem of flipping edges in triangulations of polygons and point sets. We prove that if a polygon Q n has k reflex vertices, then any triangulation of Q n can be transformed to another triangulation of Q n with at most O(n + k 2 ) flips. We produce examples of polygons with two triangulations T and T such that to transform T to T requires O(n 2 ) flips. These results are then extended to triangulations of point sets. We also show that any triangulation of an n point set always has n  4 2 edges that can be flipped. 1. Introduction Let P n = {v 1 , ..., v n } be a collection of points on the plane. A triangulation of P n is a partitioning of the convex hull Conv(P n ) of P n into a set of triangles T = {t 1 , ..., t m } with disjoint interiors in such a way that the vertices of each triangle t of T are points of P n . The elements of P n will be called the vertices of T and the edges of the triangles t 1 , ..., t m of T will be called the edges...
Filling Gaps in the Boundary of a Polyhedron
 Computer Aided Geometric Design
, 1993
"... In this paper we present an algorithm for detecting and repairing defects in the boundary of a polyhedron. These defects, usually caused by problems in CAD software, consist of small gaps bounded by edges that are incident to only one polyhedron face. The algorithm uses a partial curve matching t ..."
Abstract

Cited by 38 (4 self)
 Add to MetaCart
In this paper we present an algorithm for detecting and repairing defects in the boundary of a polyhedron. These defects, usually caused by problems in CAD software, consist of small gaps bounded by edges that are incident to only one polyhedron face. The algorithm uses a partial curve matching technique for matching parts of the defects, and an optimal triangulation of 3D polygons for resolving the unmatched parts. It is also shown that finding a consistent set of partial curve matches with maximum score, a subproblem which is related to our repairing process, is NPHard. Experimental results on several polyhedra are presented. Keywords: CAD, polyhedra, gap filling, curve matching, geometric hashing, triangulation. 1 Introduction The problem studied in this paper is the detection and repair of "gaps" in the boundary of a polyhedron. This problem usually appears in polyhedral approximations of CAD objects, whose boundaries are described using curved entities of higher leve...
Linear anisotropic mesh filtering
 IBM Research Report RC22213(W0110051), IBM T.J. Watson Research
, 2001
"... This report has been submitted for publication outside of IBM and will probably be copyrighted is accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM ..."
Abstract

Cited by 31 (1 self)
 Add to MetaCart
This report has been submitted for publication outside of IBM and will probably be copyrighted is accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). Some reports are available at
Quadrilateral Meshing with Directionality Control through the Packing of Square Cells
 Proceedings of 7th International Meshing Roundtable
, 1998
"... This paper proposes a computational method for fully automated quadrilateral meshing. Unlike previous methods, this new scheme can create a quadrilateral mesh whose directionality is precisely controlled. Given as input: (1) a 2D geometric domain, (2) a desired node spacing distribution as a scalar ..."
Abstract

Cited by 26 (8 self)
 Add to MetaCart
This paper proposes a computational method for fully automated quadrilateral meshing. Unlike previous methods, this new scheme can create a quadrilateral mesh whose directionality is precisely controlled. Given as input: (1) a 2D geometric domain, (2) a desired node spacing distribution as a scalar function defined over the domain, and (3) a desired mesh directionality as a vector field defined over the domain, the proposed method first packs square cells closely in the domain. The centers of the squares are then connected by Delaunay triangulation, yielding a triangular mesh topology. The triangular mesh is further converted into a quaddominant mesh or an allquad mesh that satisfies the given mesh directionality. Since the closely packed square cells mimic a pattern of Voroni polygons corresponding to a wellshaped graded quadrilateral mesh, the proposed method generates a high quality mesh whose element sizes and mesh directionality conform well to the given input. Keywords: quadri...
Automatic Generation of Hexahedral Finite Element Meshes
 Proceedings of the 4th International Meshing Roundtable, Sandia National Laboratories
, 1995
"... An algorithm for the generation of hexahedral element meshes is demonstrated. The algorithm starts by creating a structured grid in the interior of an object. Then the boundary region is meshed by means of an isomorphism technique that uses basically 2Doperations. Examples are given that demonstrat ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
An algorithm for the generation of hexahedral element meshes is demonstrated. The algorithm starts by creating a structured grid in the interior of an object. Then the boundary region is meshed by means of an isomorphism technique that uses basically 2Doperations. Examples are given that demonstrate the quality of the algorithm. 1 Introduction In the last years considerable progress has been made in the numerical solution of partial differential equations that describe complex physical phenomena. The state of the art allows the use of the finite element method as a tool for solving many engineering problems. Numerous programs have been developed for that purpose. With many numerical problems being solved, more attention is paid in reducing the effort to perform such simulations. In this context mesh generation plays an important role, since usually models are constructed with CAD systems and stored in formats like IGES, STEP etc, whereas finite element simulations require that the ob...