Tessellation

About: Tessellation is a research topic. Over the lifetime, 694 publications have been published within this topic receiving 11879 citations.

Re-tiling polygonal surfaces

Abstract: 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 speeding-up the off-line rendering of complex scenes. Unfortunately, generating these levels of detail is a time-consuming 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 re-tiling of a surface that is faithful to both the geometry and the topology of the original surface. The main 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 re-tiling 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 re-tiled surface. The new model is then created by removing each original vertex and locally re-triangulating the surface in a way that matches the local connectedness of the initial surface. This technique for surface retessellation has been successfully applied to iso-surface models derived from volume data, Connolly surface molecular models and a tessellation of a minimal surface of interest to mathematicians.

Computing Dirichlet Tessellations in the Plane

Abstract: A finite set of distinct points divides the plane into polygonal regions, each region containing one of the points and comprising that part of the plane nearer to its defining point than to any other. The resultant planar subdivision is called the Dirichlet tessellation; it is one of the most useful constructs associated with such a point configuration. The regions, which we call tiles, are also known as Voronoi or Thiessen polygons. We describe a recursive algorithm for computing the tessellation in a highly efficient way, and discuss the problems which arise in its implementation. Samples of graphical output demonstrate the application of the program on a modest scale; its efficiency allows its application to large sets of data, and detailed discussion of space and time considerations is given, based in part on theoretical predictions and in part on test runs on up to 10,000 points.

Honeycomb networks: Topological properties and communication algorithms

Abstract: The honeycomb mesh, based on hexagonal plane tessellation, is considered as a multiprocessor interconnection network. A honeycomb mesh network with n nodes has degree 3 and diameter /spl ap/1.63/spl radic/n-1, which is 25 percent smaller degree and 18.5 percent smaller diameter than the mesh-connected computer with approximately the same number of nodes. Vertex and edge symmetric honeycomb torus network is obtained by adding wraparound edges to the honeycomb mesh. The network cost, defined as the product of degree and diameter, is better for honeycomb networks than for the two other families based on square (mesh-connected computers and tori) and triangular (hexagonal meshes and tori) tessellations. A convenient addressing scheme for nodes is introduced which provides simple computation of shortest paths and the diameter. Simple and optimal (in the number of required communication steps) routing, broadcasting, and semigroup computation algorithms are developed. The average distance in honeycomb torus with n nodes is proved to be approximately 0.54/spl radic/n. In addition to honeycomb meshes bounded by a regular hexagon, we consider also honeycomb networks with rhombus and rectangle as the bounding polygons.