Article Fast computation of generalized Voronoi diagrams using graphics hardware Share on Authors: Kenneth E. Hoff University North Carolina at Chapel Hill, Department Computer Science ScienceView Profile , John Keyser Ming Lin Dinesh Manocha Tim Culver Authors Info & Claims SIGGRAPH '99: Proceedings the 26th annual conference and interactive techniquesJuly 1999 Pages 277–286https://doi.org/10.1145/311535.311567Published:01 July 311citation3,192DownloadsMetricsTotal Citations311Total...

Shape decomposition and skeletonization share many common properties applications. However, they are generally treated as independent computations. In this paper, we propose an iterative approach that simultaneously generates a hierarchical shape corresponding set of multi-resolution skeletons. our method, skeleton model is extracted from the components its --- is, both processes qualities their results interdependent. particular, if quality does not meet some user specified criteria, then...

When rendering light colored hair, multiple fiber scattering is essential for the right perception of overall hair color. In this context, we present a novel technique to efficiently approximate full head human or similar based geometry. contrast previous ad-hoc approaches, our method relies on physically accurate concept Bidirectional Scattering Distribution Functions and gives plausible results with no need parameter tweaking. We show that complex effects can be approximated very well by...

We present a new method for the real-time simulation of fluid surface waves and their interactions with floating objects. The is based on concept wave particles, which offers simple, fast, unconditionally stable approach to simulation. show how graphics hardware can be used convert particles height field surface, warped horizontally account local wave-induced flow. appropriate most situations that do not involve significant global It demonstrated work well in constrained areas, including...

The coloring of 3D models using 2D or texture mapping has well-known intrinsic problems, such as discontinuities and limitations to model editing after coloring. Workarounds for these problems often require adopting very complex approaches. Here we propose a new technique, called mesh colors, associating color data directly with polygonal mesh. approach eliminates deriving from map space space. Mesh colors is an extension vertex where, in addition keeping values on each vertex, they are also...

We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram computation are applicable to both static and dynamic environments fairly high complexity. compute a rendering 3D distance mesh each site. The sites can be points, line segments, polygons, polyhedra, curves surfaces. the provides proximity query toolkits planning. tools provide nearest obstacle stored in Z-buffer,...

Article Free Access Share on Accurate computation of the medial axis a polyhedron Authors: Tim Culver Department Computer Science, University North Carolina, Chapel Hill, NC NCView Profile , John Keyser Dinesh Manocha Authors Info & Claims SMA '99: Proceedings fifth ACM symposium Solid modeling and applicationsJune 1999 Pages 179–190https://doi.org/10.1145/304012.304030Online:01 June 1999Publication History 54citation794DownloadsMetricsTotal Citations54Total Downloads794Last 12 Months14Last...

Despite the visual importance of hair and attention paid to modeling in graphics research, realistic still remains a very challenging task that can be performed by few artists. In this paper we present meshes , new method for aims bring as close possible polygonal surfaces. This approach provides artists with direct control overall shape hair, giving them ability model exact they desire. We use mesh structure volume topological constraints allow us automatically uniquely trace path...

Abstract We present a new method for rapidly computing shadows from semi‐transparent objects like hair. Our deep opacity maps extends the concept of shadow by using depth map to obtain per pixel distribution layers. This approach eliminates layering artifacts and requires far fewer layers achieve high quality computation. Furthermore, it is faster than density clustering technique, produces less noise with comparable quality. provide qualitative comparisons these previous methods give...

We present a new method for the real-time simulation of fluid surface waves and their interactions with floating objects. The is based on concept wave particles, which offers simple, fast, unconditionally stable approach to simulation. show how graphics hardware can be used convert particles height field surface, warped horizontally account local wave-induced flow. appropriate most situations that do not involve significant global It demonstrated work well in constrained areas, including...

Accurate microvascular morphometric information has significant implications in several fields, including the quantification of angiogenesis cancer research, understanding immune response for neural prosthetics, and predicting nature blood flow as it relates to stroke. We report imaging whole mouse brain system at resolutions sufficient perform accurate morphometry. Imaging was performed using Knife-Edge Scanning Microscopy (KESM) is first example this technique that can be directly applied...

No abstract available.

Connectomics is the study of full connection matrix brain. Recent advances in high-throughput, high-resolution 3D microscopy methods have enabled imaging whole small animal brains at a sub-micrometer resolution, potentially opening road to full-blown connectomics research. One first such instruments achieve whole-brain-scale resolution Knife-Edge Scanning Microscope (KESM). KESM whole-brain data sets now include Golgi (neuronal circuits), Nissl (soma distribution), and India ink (vascular...

In this work, we describe an automated method for directing the control of a high resolution gaseous fluid simulation based on results lower preview simulation. Small variations in accuracy between low and grids can lead to divergent simulations, which is problematic those wanting achieve desired behavior. Our goal provide simple ensuring that matches key properties from We first let user specify fast, coarse will be used guidance. samples data matched at various positions scales simulation,...

We propose a method for applying genetic algorithms to create 3D terrain data sets. Existing procedural generation of have several shortcomings. The most popular approach, fractal-based generation, is efficient, but difficult user control. Other methods tend require too much input. In this paper, we provide an alternative that uses two-pass algorithm approach produce variety types using only intuitive inputs. allow specify rough sketch region boundaries, and refine these boundaries...

Article Free Access Share on MAPC: a library for efficient and exact manipulation of algebraic points curves Authors: John Keyser Department Computer Science, University North Carolina, Chapel Hill, NC NCView Profile , Tim Culver Dinesh Manocha Shankar Krishnan AT & T Research Labs Authors Info Claims SCG '99: Proceedings the fifteenth annual symposium Computational geometryJune 1999 Pages 360–369https://doi.org/10.1145/304893.304990Online:13 June 1999Publication History...

The behavior of Catmull-Rom curves heavily depends on the choice parameter values at control points. We analyze a class parameterizations ranging from uniform to chordal parameterization and show that, within this class, with centripetal contain properties that no other in family possess. Researchers have previously indicated produces visually favorable compared parameterizations. However, mathematical reasons behind been ambiguous. In paper we prove for cubic curves, is only guarantees do...

In this paper we describe a fast and interactive model to simulate control the fire phenomenon. We use modified fluid dynamics solver motion of 3-gas system. oxidizing air, fuel gases, exhaust gases. The burning process is simulated by consuming air based on amounts inside each grid cell. By modeling heat distribution, also spread self-ignition in other combustible solids.