Filters








291 Hits in 6.1 sec

Accelerating Ray Tracing using Constrained Tetrahedralizations

Ares Lagae, Philip Dutré
2008 Computer graphics forum (Print)  
We show that constrained tetrahedralizations are a viable alternative to current acceleration structures, and that they have a number of unique properties that set them apart from other acceleration structures  ...  We show that constrained tetrahedralizations are a viable alternative to current acceleration structures, and that they have a number of unique properties that set them apart from other acceleration structures  ...  Acknowledgments Ares Lagae is a Postdoctoral Fellow of the Research Foundation -Flanders (FWO). We are grateful to Peter Vangorp and Jurgen Laurijssen for last minute help.  ... 
doi:10.1111/j.1467-8659.2008.01269.x fatcat:ea4vduzzinb2jedaesoecojepu

Accelerating ray tracing using constrained tetrahedralizations

Ares Lagae, Philip Dutré
2008 ACM SIGGRAPH 2008 posters on - SIGGRAPH '08  
We show that constrained tetrahedralizations are a viable alternative to current acceleration structures, and that they have a number of unique properties that set them apart from other acceleration structures  ...  We show that constrained tetrahedralizations are a viable alternative to current acceleration structures, and that they have a number of unique properties that set them apart from other acceleration structures  ...  Acknowledgments Ares Lagae is a Postdoctoral Fellow of the Research Foundation -Flanders (FWO). We are grateful to Peter Vangorp and Jurgen Laurijssen for last minute help.  ... 
doi:10.1145/1400885.1401006 dblp:conf/siggraph/LagaeD08 fatcat:ox2ncnq3erefjcwzuqesmdlufy

Accelerating ray tracing using constrained tetrahedralizations

Ares Lagae, Philip Dutre
2008 2008 IEEE Symposium on Interactive Ray Tracing  
We show that constrained tetrahedralizations are a viable alternative to current acceleration structures, and that they have a number of unique properties that set them apart from other acceleration structures  ...  We show that constrained tetrahedralizations are a viable alternative to current acceleration structures, and that they have a number of unique properties that set them apart from other acceleration structures  ...  Acknowledgments Ares Lagae is a Postdoctoral Fellow of the Research Foundation -Flanders (FWO). We are grateful to Peter Vangorp and Jurgen Laurijssen for last minute help.  ... 
doi:10.1109/rt.2008.4634647 fatcat:gs2lqyvxzneyvharnf4bioohxe

Voronoi Hierarchies [chapter]

Christopher Gold, Paul Angel
2006 Lecture Notes in Computer Science  
While one-level Voronoi indexes have been used before, and hierarchies of the dual Delaunay triangulation have been used for fast point location, we believe that this is the first time that the advantages  ...  Voronoi diagrams are widely used to represent geographical distributions of information, but they are not readily stacked in a hierarchical fashion.  ...  This means that VCs are not fully hierarchical to each other, unlike a quad tree where each region is a subdivision of a higher region.  ... 
doi:10.1007/11863939_7 fatcat:kyhzglqywrgznhwchpgh4mdsnq

Spanning Trees and Spanners [chapter]

David Eppstein
2000 Handbook of Computational Geometry  
We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs.  ...  Given a set of n points in R d , we can form a hierarchical collection of O(n log d−1 n) bi-chromatic closest pair problems, so that each point is involved in O(i d−1 ) problems of size O(n/2 i ) (1 ≤  ...  closest pairs dynamically.  ... 
doi:10.1016/b978-044482537-7/50010-3 fatcat:gitonpgfozgfribivszd6gf5cy

Collision Detection Optimization in a Multi-particle System [chapter]

Marina L. Gavrilova, Jon Rokne
2002 Lecture Notes in Computer Science  
We employ dynamic computational geometry data structures as a tool for collision detection optimization.  ...  The data structures under consideration are the dynamic generalized Voronoi diagram, the regular spatial subdivision, the regular spatial tree and the set of segment trees.  ...  Other advanced kinetic data structures, commonly employed in computational geometry for solving a variety of problems (such as point location, motion planning, nearest-neighbor searches [7, 11, 1] ),  ... 
doi:10.1007/3-540-47789-6_11 fatcat:kmx5qtj7m5arvmfy4kqrxut6vm

COLLISION DETECTION OPTIMIZATION IN A MULTI-PARTICLE SYSTEM

MARINA L. GAVRILOVA, JON ROKNE
2003 International journal of computational geometry and applications  
We employ dynamic computational geometry data structures as a tool for collision detection optimization.  ...  The data structures under consideration are the dynamic generalized Voronoi diagram, the regular spatial subdivision, the regular spatial tree and the set of segment trees.  ...  Other advanced kinetic data structures, commonly employed in computational geometry for solving a variety of problems (such as point location, motion planning, nearest-neighbor searches [7, 11, 1] ),  ... 
doi:10.1142/s0218195903001189 fatcat:k5jrq5h2bffs7ksi3zcy7bezua

Feature preserving Delaunay mesh generation from 3D multi-material images

Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat
2009 Computer graphics forum (Print)  
The optimization property of the Delaunay triangulation makes these meshes suitable for the purpose of realistic visualization or finite element simulations.  ...  We present a feature preserving Delaunay refinement algorithm which can be used to generate high-quality tetrahedral meshes from segmented images.  ...  We would also like to thank the anonymous reviewers for their valuable comments. All of the segmented medical images in this paper are courtesy of IRCAD.  ... 
doi:10.1111/j.1467-8659.2009.01522.x fatcat:633kokdutzasze22nuppgqi4o4

Fingerprint verification using computational geometry

Manuel Ramírez Flores, Gualberto Aguilar Torres, Gina Gallegos García, Miguel Ángel García Licona
2016 Dyna  
The proposed method uses Delaunay Triangulation to represent minutiae as nodes of a connected graph composed of triangles.  ...  This paper presents a robust minutiae based method for fingerprint verification.  ...  Acknowledgements This paper was supported by the CONACyT and the IPN.  ... 
doi:10.15446/dyna.v83n195.46323 fatcat:brfbym4fbfbave5a7sbxadm3uu

Surface reconstruction using bivariate simplex splines on Delaunay configurations

Juan Cao, Xin Li, Guozhao Wang, Hong Qin
2009 Computers & graphics  
Our framework takes a triangulated set of points, and by solving a linear least-square problem and iteratively refining parameter domains with newly added knots, we can finally obtain a continuous spline  ...  We demonstrate the efficacy and effectiveness of our algorithm on real-world, scattered datasets for shape representation and computing.  ...  Acknowledgments The models are courtesy of the AIM@SHAPE Repository and the Standford 3D Scanning Repository.  ... 
doi:10.1016/j.cag.2009.03.013 fatcat:erkdsfmsn5d6zcygwex4mcy6lm

Navigation Queries from Triangular Meshes [chapter]

Marcelo Kallmann
2010 Lecture Notes in Computer Science  
Navigation meshes are commonly employed as a practical representation for path planning and other navigation queries in animated virtual environments and computer games.  ...  This paper explores the use of triangulations as a navigation mesh, and discusses several useful triangulation-based algorithms and operations: environment modeling and validity, automatic agent placement  ...  Let r be the radius of the circle representing the agent location and let T be a Delaunay triangulation (of points) being built.  ... 
doi:10.1007/978-3-642-16958-8_22 fatcat:wc6xo4klf5ekzexvruvfwsvkwu

Recursive Algorithm for Determination of Proximal (Thiessen) Polygons in Any Metric Space

David M. Mark
2010 Geographical Analysis  
1984; Samet et al. 1984) in order to solve a number of closest-point problems.  ...  Brassel and Reif have provided a useful review of the history of the topic. Proximal polygons are useful in a variety of closest-point problems (see Sha- mos and Bentley 1978).  ... 
doi:10.1111/j.1538-4632.1987.tb00129.x fatcat:u3p6cxhdi5htbow2wnf7puojve

Motion Planning of Autonomous Agents Situated in Informed Virtual Geographic Environments

Mehdi Mekni, Bernard Moulin
2010 2010 Second International Conference on Advanced Geographic Information Systems, Applications, and Services  
Furthermore, we propose a topologic abstraction algorithm which builds a Hierarchical Topologic Graph (HTG) describing the IVGE and a Hierarchical Path Planning (HPP) algorithm which uses this graph.  ...  and other agents.  ...  ACKNOWLEDGEMENT Mehdi Mekni benefited from a PDF scholarship granted by FQRNT (Fonds Québécois de la Recherche sur la Nature et les Technologies).  ... 
doi:10.1109/geoprocessing.2010.8 fatcat:h4eroxoohzhojjymkozl67bqea

Multiresolution analysis of arbitrary meshes

Matthias Eck, Tony DeRose, Tom Duchamp, Hugues Hoppe, Michael Lounsbery, Werner Stuetzle
1995 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95  
Multiresolution analysis offers a simple, unified, and theoretically sound approach to dealing with these problems.  ...  Lounsbery et al. have recently developed a technique for creating multiresolution representations for a restricted class of meshes with subdivision connectivity.  ...  Acknowledgments This work was supported in part by a postdoctoral fellowship for the lead author (Eck) from the German Research Foundation (DFG), Alias Research Inc., Microsoft Corp., and the National  ... 
doi:10.1145/218380.218440 dblp:conf/siggraph/EckDDHLS95 fatcat:h32x73qdwzbqjjfgc4dfueqaye

Kinetic Data Structures [chapter]

2006 Geometric Data Structures for Computer Graphics  
The edges of the Delaunay triangulation contain the closest pair of points, the closest neighbor to each point, as well as a wealth of other proximity information among the points.  ...  Proximity problems The fundamental proximity structures in computational geometry are the Voronoi Diagram and the Delaunay triangulation.  ... 
doi:10.1201/b10626-9 fatcat:25iax4fy55bavpa5iujdck4f6i
« Previous Showing results 1 — 15 out of 291 results