M. Pellegrini  Home/Search
Context Related
| imc.pi.cnr.it/~mar...rayshootjp2bis.ps Cached: PS.gz PS 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.
Image Update HelpPS.gz PS PDF From: imc.pi.cnr.it/~ma...publications2 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a uniform approach to problems involving lines in 3-space. This approach is based on mapping lines in R 3 into points and hyperplanes in 5-dimensional projective space (Plucker space). We obtain new results on the following problems: 1. Preprocess n triangles so as to efficiently answer the query: "Given a ray, which is the first triangle hit?" (Ray-shooting problem). We discuss the ray-shooting problem for both disjoint and non-disjoint triangles. 2. Construct the... (Update)
Context of citations to this paper: More
...but hard for polyhedra. The fastest algorithm for deciding whether two static nonconvex polyhedra intersect, due to Pellegrini, runs in ) [31]. For polyhedral terrains, the time bound can be improved to O(n 4 3 # ) 7] Pellegrini s algorithm was generalized by Schomer and...
...and only if Q e intersects P . This intersection problem can be solved in O(n ) time, using simplex range searching data structures [231, 246]. Plugging this into the parametric searching machinery, we can compute, in O(n ) time, the first intersection of Q with P as Q moves...
Cited by: More
The expected number of 3D visibility events is linear - Devillers, al. (2002) (Correct)
A Linear Bound on the Expected Number of Visibility.. - Devillers, Dujmovic.. (2002) (Correct)
Local Polyhedra and Geometric Graphs - Erickson (2003) (Correct)
Similar documents (at the sentence level):
5.3%: On Collision-Free Placements of Simplices and the Closest Pair.. - Pellegrini (1994) (Correct)
Active bibliography (related documents): More All
1.7: Stabbing and Ray Shooting in 3 Dimensional Space - Pellegrini (1994) (Correct)
0.8: Efficient Ray Shooting and Hidden Surface Removal - de Berg, al. (1991) (Correct)
0.7: Repetitive Hidden-Surface-Removal for Polyhedra - Pellegrini (1993) (Correct)
Similar documents based on text: More All
0.4: New Algorithmic Results for Lines-in-3-Space Problems - Guibas, Pellegrini (1992) (Correct)
0.3: A New Algorithm for Counting Circular Arc Intersections - Pellegrini (1992) (Correct)
0.2: Cost Prediction for Ray Shooting - Aronov, Brönnimann, Chang, Chiang (2002) (Correct)
Related documents from co-citation: More All
15: Ray shooting and parametric search (context) - Agarwal, Matousek - 1993
11: On range searching with semialgebraic sets - AGARWAL, MATOU - 1994
10: Davenport-Schinzel Sequences and Their Geometric Applications - Agarwal, Sharir - 1995
BibTeX entry: (Update)
M. Pellegrini. Ray shooting on triangles in 3-space. Algorithmica, 9:471--494, 1993. http://citeseer.ist.psu.edu/pellegrini93rayshooting.html More
@article{ pellegrini93ray,
author = "Marco Pellegrini",
title = "Ray Shooting on Triangles in 3-Space",
journal = "Algorithmica",
volume = "9",
number = "5",
pages = "471-494",
year = "1993",
url = "citeseer.ist.psu.edu/pellegrini93rayshooting.html" }
Citations (may not include all citations):481 Algorithms in Combinatorial Geometry (context) - Edelsbrunner - 1987
114 An optimal algorithm for intersecting line segments in the p.. (context) - Chazelle, Edelsbrunner - 1988
92 Determining the separation of preprocessed polyhedra: a unif.. - Dobkin, Kirkpatrick - 1990
90 Ray tracing complex scenes (context) - Kay, Kajiya - 1986
90 New applications of random sampling in computational geometr.. - Clarkson - 1987
78 Constructing arrangements of lines and hyperplanes with appl.. (context) - Edelsbrunner, O'Rourke et al. - 1986
69 Fast ray tracing by ray classification (context) - Arvo, Kirk - 1987
64 A randomized algorithm for closest-point queries (context) - Clarkson - 1988
56 Constructing higher-dimensional convex hulls at logarithmic .. (context) - Seidel - 1986
52 Quasi-optimal upper bounds for simplex range searching and n.. (context) - Chazelle, Sharir et al. - 1990
49 An optimal algorithm for intersecting threedimensional conve.. (context) - Chazelle - 1989
43 General techniques for computing topological properties of r.. (context) - Schwartz, Sharir et al. - 1983
43 Visibility problems for polyhedral terrains (context) - Cole, Sharir - 1986
40 Finding the intersection of two convex polyhedra (context) - Muller, Preparata - 1978
34 Applications of a new space partitioning technique (context) - Agarwal, Sharir - 1991
33 Analytical geometry of three dimensions (context) - Sommerville - 1951
31 Cutting hyperplane arrangements (context) - Matousek - 1990
30 Efficient ray-shooting and hidden surface removal (context) - de Berg, Halperlin et al. - 1991
25 An efficient output-sensitive hiddensurface removal algorith.. - Reif, Sen - 1988
22 Computer Graphics and Image Processing (context) - Roth, for - 1982
22 Hidden surface removal for rectangles (context) - Bern - 1988
21 An optimal convex hull algorithm and new results on cuttings (context) - Chazelle - 1991
21 Analytic inequalities (context) - Mitrinovic - 1970
19 the sum of squares of cell complexities in hyperplane arrang.. - Aronov, Matousek et al. - 1991
15 Stabbing line segments (context) - Edelsbrunner, Mauer et al. - 1982
14 Stabbing and ray shooting in 3 dimensional space - Pellegrini - 1990
14 Output-sensitive hidden surface removal (context) - Overmars, Sharir - 1989
13 Arrangements of lines in 3space: A data structure with appli.. (context) - McKenna, O'Rourke - 1988
13 An algorithm for generalized point location and its applicat.. (context) - Chazelle, Sharir - 1988
11 Binary partitions with applications to hidden surface remova.. (context) - Paterson, Yao - 1989
10 Intersecting two polyhedra one of which is convex (context) - Mehlhorn, Simon - 1985
9 Primitives for computational geometry (context) - Stolfi - 1989
8 The complexity of many faces in arrangements of lines and se.. (context) - Edelsbrunner, Guibas et al. - 1988
7 Partitioning arrangements of lines II: Applications (context) - Agarwal - 1990
7 Ray tracing algorithms - theory and practice (context) - Schmitt, Muller et al. - 1988
7 algorithms and applications (context) - Chazelle, Edelsbrunner et al. - 1989
5 Partitioning arrangements of lines I: An efficient determini.. (context) - Agarwal - 1990
5 Finding stabbing lines in 3dimensional space (context) - Pellegrini, Shor - 1991
5 Combinatorial and Algorithmic Analysis of Stabbing and Visib.. (context) - Pellegrini - 1991
4 Ray tracing (context) - Glassner - 1989
4 Fast searching in a real algebraic manifold with application.. (context) - Chazelle - 1985
4 Visibility with a moving point (context) - Bern, Dobkin et al. - 1990
4 The shortest watchtower and related problems for polyhedral .. (context) - Sharir - 1988
4 Ray shooting and isotopy classes of lines in 3dimensional sp.. (context) - Pellegrini - 1991
3 Merging visibility maps (context) - Overmars, Sharir - 1990
3 implicit point location and related queries in arrangements .. (context) - Guibas, Overmars et al. - 1989
2 the zone of an algebraic surface in a hyperplane arrangement (context) - Aronov, Pellegrini et al. - 1991
1 A Different geometric permutations in the same Plucker cell (context) - Tarjan, Network et al. - 1983
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.imc.pi.cnr.it/~marcop/publications2.html): More
On Lines Missing Polyhedral Sets in 3-Space - Pellegrini (1998) (Correct)
Finding Stabbing Lines in 3-Space - Pellegrini, Shor (1992) (Correct)
On Collision-Free Placements of Simplices and the Closest Pair.. - Pellegrini (1994) (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