GPGPU » Tag: Computational Geometry :: GPGPU.org http://gpgpu.org General-Purpose Computation on Graphics Hardware Mon, 06 Feb 2012 04:59:24 +0000 en hourly 1 http://wordpress.org/?v=3.3.1 Applying graphics hardware to achieve extremely fast geometric pattern matching http://gpgpu.org/2009/04/05/aiger-geometric-pattern-matching http://gpgpu.org/2009/04/05/aiger-geometric-pattern-matching#comments Mon, 06 Apr 2009 01:31:12 +0000 admin http://gpgpu.org/?p=1725

Abstract:

We present a GPU-based approach to geometric pattern matching. We reduce this problem to ?nding the depth (maximally covered point) of an arrangement of polytopes in transformation space and describe hardware-assisted (GPU) algorithms which exploit the available set of graphics operations to perform a fast rasterized depth computation.

(Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space. Dror Aiger and Klara Kedem. Information Processing Letters. 2008.)

]]> http://gpgpu.org/2009/04/05/aiger-geometric-pattern-matching/feed 0 Jump Flooding in GPU with Applications to Voronoi Diagram and Distance Transform http://gpgpu.org/2006/03/12/jump-flooding-in-gpu-with-applications-to-voronoi-diagram-and-distance-transform http://gpgpu.org/2006/03/12/jump-flooding-in-gpu-with-applications-to-voronoi-diagram-and-distance-transform#comments Sun, 12 Mar 2006 15:35:00 +0000 Mark Harris http://www.gpgpu.org/cgi-bin/blosxom.cgi/ComputationalGeometry/guodong06.html This paper studies jump flooding as an algorithmic paradigm in general-purpose computation with GPUs. As an example application of jump flooding, the paper discusses a constant time algorithm on the GPU to compute an approximation to the Voronoi diagram of a given set of seeds in a 2D grid. The errors due to the differences between the approximation and the actual Voronoi diagram are hardly noticeable to the naked eye in all presented experiments. The same approach can also compute in constant time an approximation to the distance transform of a set of seeds in a 2D grid. In practice, such constant time algorithm is useful to many interactive applications involving, for example, rendering and image processing. Besides the experimental evidence, this paper also confirms quantitatively the effectiveness of jump flooding by analyzing the occurrences of errors. The analysis is a showcase of insights to the jump flooding paradigm, and may be of independent interest to other applications of jump flooding. (Jump Flooding in GPU with Applications to Voronoi Diagram and Distance Transform. Guodong Rong and Tiow-Seng Tan. To appear in 2006 SIGGRAPH Symposium on Interactive 3D Graphics and Games. [I3D 2006] )

]]> http://gpgpu.org/2006/03/12/jump-flooding-in-gpu-with-applications-to-voronoi-diagram-and-distance-transform/feed 0 DiFi: Fast 3D Distance Field Computation Using Graphics Hardware http://gpgpu.org/2004/04/10/difi-fast-3d-distance-field-computation-using-graphics-hardware http://gpgpu.org/2004/04/10/difi-fast-3d-distance-field-computation-using-graphics-hardware#comments Sat, 10 Apr 2004 17:54:00 +0000 Mark Harris http://www.gpgpu.org/cgi-bin/blosxom.cgi/ComputationalGeometry/sudDiFi.html This paper by Sud et al. at UNC-Chapel Hill, describes an algorithm for fast computation of discretized 3D distance fields using graphics hardware. It uses bounds on the spatial extent of the Voronoi region of each primitive to cull away many distance functions for each 2D slice. A combination of culling and clamping techniques results in rendering relatively few distance functions to reduce the load on the graphics pipeline. The algorithm is applicable to all geometric models and does not make any assumptions about connectivity or a manifold representation. The application is demonstrated for medial axis evaluation and proximity computations. As compared to earlier approaches, this GPU implementation achieves an order of magnitude improvement in the running time. (DiFi: Fast 3D Distance Field Computation Using Graphics Hardware. Avneesh Sud, Miguel A. Otaduy and Dinesh Manocha in Proc. Eurographics 2004, to appear, 2004.)

]]> http://gpgpu.org/2004/04/10/difi-fast-3d-distance-field-computation-using-graphics-hardware/feed 0 Generalized Distance Transforms and Skeletons in Graphics Hardware http://gpgpu.org/2004/03/16/generalized-distance-transforms-and-skeletons-in-graphics-hardware http://gpgpu.org/2004/03/16/generalized-distance-transforms-and-skeletons-in-graphics-hardware#comments Tue, 16 Mar 2004 04:50:00 +0000 Mark Harris http://www.gpgpu.org/cgi-bin/blosxom.cgi/AdvancedRendering/Image-BasedModeling&Rendering/strzodkaDistTransform.html This paper presents the computation of the feature distance transform (FDT) with an arbitrary distance function and the corresponding 2D skeleton or Voronoi diagram in DX8 or DX9 graphics hardware. Together with a direct, non-iterative distance measurement, the FDT enables us to compute a simply connected pixel-exact skeleton, which can be continously pruned with a regularization parameter. Real-time distance minimization in the zooming process delivers even sub-pixel accuracy. There are no restrictions on the distance function and additive and multiplicative weights can be applied. An adaptive tiling scheme delivers a ten-fold performance increase over a software or simple hardware implementation. (Generalized Distance Transforms and Skeletons in Graphics Hardware. Robert Strzodka and Alexandru Telea in Proceedings VisSym’04, to appear, 2004)

]]> http://gpgpu.org/2004/03/16/generalized-distance-transforms-and-skeletons-in-graphics-hardware/feed 0 Streaming Geometric Optimization using Graphics Hardware http://gpgpu.org/2004/03/15/streaming-geometric-optimization-using-graphics-hardware http://gpgpu.org/2004/03/15/streaming-geometric-optimization-using-graphics-hardware#comments Mon, 15 Mar 2004 12:51:00 +0000 Mark Harris http://www.gpgpu.org/cgi-bin/blosxom.cgi/ComputationalGeometry/sureshGeomOptimization.html This paper proposes algorithms for computing extent measures and approximate representations of a stream of points in R2 or R3. In particular, we study the problems of computing various extent measures (for example diameter, width, smallest enclosing rectangle, and smallest enclosing disk) and of approximating a set of points by a circle or a line. We show that these problems can be solved efficiently using graphics hardware even in the streaming model. (P. Agarwal, S. Krishnan, N. Mustafa and S. Venkatasubramanian. Streaming Geometric Optimization Using Graphics Hardware. Proc. 11th European Symposium on Algorithms, Sep 2003.)

]]> http://gpgpu.org/2004/03/15/streaming-geometric-optimization-using-graphics-hardware/feed 0 Improved CSG Rendering using Overlap Graph Subtraction Sequences http://gpgpu.org/2003/03/17/improved-csg-rendering-using-overlap-graph-subtraction-sequences http://gpgpu.org/2003/03/17/improved-csg-rendering-using-overlap-graph-subtraction-sequences#comments Mon, 17 Mar 2003 17:59:00 +0000 Mark Harris http://www.gpgpu.org/cgi-bin/blosxom.cgi/ComputationalGeometry/stewartCSG.html Abstract: The Sequenced Convex Subtraction (SCS) algorithm for Constructive Solid Geometry (CSG) sequentially subtracts convex volumes from the z-buffer. This paper presents an improvement to subtraction sequence generation which uses object space overlap information to give O(n) length sequences in the best case and (unchanged) O(n2) sequences in the worst case. (Improved CSG Rendering using Overlap Graph Subtraction Sequences. N. Stewart, G. Leach, S. John. International Conference on Computer Graphics and Interactive Techniques in Australasia and South East Asia – GRAPHITE 2003, pp. 47-53)

]]> http://gpgpu.org/2003/03/17/improved-csg-rendering-using-overlap-graph-subtraction-sequences/feed 0 Hardware-Assisted Computation of Depth Contours http://gpgpu.org/2003/01/23/hardware-assisted-computation-of-depth-contours http://gpgpu.org/2003/01/23/hardware-assisted-computation-of-depth-contours#comments Thu, 23 Jan 2003 20:00:00 +0000 Mark Harris http://www.gpgpu.org/cgi-bin/blosxom.cgi/ComputationalGeometry/KrishnanDepthCountour2002.html This paper by Krishnan et al. demonstrates a large class of non-parametric statistical analysis problems that can be solved using the graphics hardware. It shows how to do duality transforms and operations in primal and dual geometric planes in a robust way using the graphics pipeline. (Hardware-Assisted Computation of Depth Contours. S. Krishnan, N. Mustafa and S. Venkatasubramanian. 13th ACM-SIAM Symposium on Discrete Algorithms).

]]> http://gpgpu.org/2003/01/23/hardware-assisted-computation-of-depth-contours/feed 0 Hardware Assisted View Dependent Map Simplification http://gpgpu.org/2003/01/23/hardware-assisted-view-dependent-map-simplification http://gpgpu.org/2003/01/23/hardware-assisted-view-dependent-map-simplification#comments Thu, 23 Jan 2003 20:00:00 +0000 Mark Harris http://www.gpgpu.org/cgi-bin/blosxom.cgi/ComputationalGeometry/GIS/MustafaMaps2001.html This paper by Mustafa et al. examines the use of graphics hardware as a general purpose geometry engine to compute simplification of large geographic maps in real-time. (Hardware Assisted View Dependent Map Simplification. N. Mustafa, E. Koutsofios, S. Krishnan and S. Venkatasubramanian. 17th Annual ACM Symposium on Computational Geometry, June 2001)

]]> http://gpgpu.org/2003/01/23/hardware-assisted-view-dependent-map-simplification/feed 0 Application of the Two-Sided Depth Test to CSG Rendering http://gpgpu.org/2003/01/23/the-power-of-a-two-sided-depth-test-and-its-application-to-csg-rendering-and-depth-extraction http://gpgpu.org/2003/01/23/the-power-of-a-two-sided-depth-test-and-its-application-to-csg-rendering-and-depth-extraction#comments Thu, 23 Jan 2003 20:00:00 +0000 Mark Harris http://www.gpgpu.org/cgi-bin/blosxom.cgi/ComputationalGeometry/Guha2SidedDepth2003.html This paper by Guha et al., to appear in the 2003 ACM SIGGRAPH Symposium on Interactive 3D graphics, shows how the shadow mapping operation in the new NVIDIA GeForce4 cards can be viewed as a two-sided depth test in order to do CSG rendering efficiently. The result is an algorithm that can perform a topological sweep over an arrangement of objects in three dimensions. It also shows the first lower bounds on the number of rendering passes required for a hardware-assisted computation. (Application of the Two-Sided Depth Test to CSG Rendering. S. Guha, K. Munagala, S. Krishnan and S. Venkatasubramanian. To appear in the 2003 ACM SIGGRAPH Symposium on Interactive 3D graphics.)

]]> http://gpgpu.org/2003/01/23/the-power-of-a-two-sided-depth-test-and-its-application-to-csg-rendering-and-depth-extraction/feed 0 SIGGRAPH2002 Course: Interactive Geometric Computations with Graphics Hardware http://gpgpu.org/2002/11/19/siggraph2002-course-interactive-geometric-computations-with-graphics-hardware http://gpgpu.org/2002/11/19/siggraph2002-course-interactive-geometric-computations-with-graphics-hardware#comments Tue, 19 Nov 2002 20:00:00 +0000 Mark Harris http://www.gpgpu.org/cgi-bin/blosxom.cgi/Miscellaneous/Courses/SIGGRAPH2002Geom.html This SIGGRAPH 2002 course, organized by Dinesh Manocha of UNC Chapel Hill, covered approaches to using graphics hardware for various geometric problems, including voronoi computation, proximity
queries, motion planning, and more.

]]> http://gpgpu.org/2002/11/19/siggraph2002-course-interactive-geometric-computations-with-graphics-hardware/feed 0