Afra Zomorodian, Herbert Edelsbrunner  Home/Search
Context Related
| duke.edu/~afra/papers/...socg2000.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: duke.edu/~afra/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a fast implementation of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler algorithms for low numbers of boxes. We use our implementations as engines to solve problems about geometric primitives. We look at two such problems in the category of quality analysis of surface triangulations. General Terms box intersection, algorithms, segment tree, range tree, implementation, quanti cation,... (Update)
Similar documents based on text: More All
0.3: Computing Persistent Homology - Afra Zomorodian Dept (Correct)
0.3: Topological Persistence and Simplification - Edelsbrunner, Letscher.. (2001) (Correct)
0.3: Geometric Filtering of Pairwise Atomic Interactions.. - Zomorodian, Guibas.. (Correct)
Related documents from co-citation: More All
3: Computational Geometry: Algorithms and Applications (context) - de Berg, van Kreveld et al. - 1997
3: Collision detection for deforming necklaces (context) - Guibas, Nguyen et al. - 2002
2: Hessian Eigenmaps: Locally linear embedding techniques for high-dimensional data (context) - Donoho, Grimes - 2003
BibTeX entry: (Update)
A. Zomorodian and H. Edelsbrunner. Fast software for box intersections. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 129--138, 2000. 7 http://citeseer.ist.psu.edu/zomorodian00fast.html More
@article{ zomorodian02fast,
author = "Afra Zomorodian and Herbert Edelsbrunner",
title = "Fast Software for Box Intersections",
journal = "International Journal of Computational Geometry and Applications",
volume = "12",
number = "1-2",
pages = "143-172",
year = "2002",
url = "citeseer.ist.psu.edu/zomorodian00fast.html" }
Citations (may not include all citations):831 Computer Graphics: Principles and Practice (context) - Foley, van Dam et al. - 1996
625 Kluwer Academic Publishers (context) - Latombe - 1991
279 OBB-tree: A hierarchical structure for rapid interference de.. - Gottschalk, Lin et al. - 1996
109 Multidimensional divide and conquer (context) - Bentley - 1980
63 Collision detection between geometric models: a survey - Lin, Gottschalk - 1998
35 Spherical shell: A higher order bounding volume for fast pro.. - Krishnan, Pattekar et al. - 1998
29 Batched dynamic solutions to decomposable searching problems (context) - Edelsbrunner, Overmars - 1985
28 Geometric intersection problems (context) - Shamos, Hoey - 1976
25 An optimal worst case algorithm for reporting intersections .. (context) - Bentley, Wood - 1980
18 Spatial Data Structures: Quadtree (context) - Samet - 1989
14 Merging BSP trees yield polyhedral modeling results (context) - Naylor, Amanatides et al. - 1990
14 Geometric range searching - sek - 1994
11 Approximating center points with iterative radon points (context) - Clarkson, Eppstein et al. - 1996
7 trees: a dynamic index structure for spatial searching (context) - Guttmann - 1984
5 Multidimensional search trees used for associative searching (context) - Bentley - 1975
4 Theory and practice (context) - Knuth - 1996
Documents on the same site (http://www.cs.duke.edu/~afra/papers.html): More
Fast Software for Box Intersections - Afra Zomorodian And (2000) (Correct)
Topological Persistence and Simplification - Edelsbrunner, Letscher, al. (2000) (Correct)
Topological Persistence and Simplification - Letscher, Zomorodian (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC