Teller S., Personal communication, 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Quickhull Algorithm for Convex Hulls - Barber, Dobkin, Huhdanpaa (1996) (89 citations) (Correct)
.... is the Delaunay triangulation of the original points [Brown 1979] The intersection of halfspaces about the origin is equivalent to the convex hull of the points in dual space [Preparata and Shamos 1985] To determine the intersection of halfspaces: locate an interior point by linear programming [Teller 1994], translate the interior point to the origin, transform halfspaces into points by dividing offsets into coefficients, and compute the convex hull. Via the duality transform, each facet of the convex hull defines a point of intersection of the halfspaces. Recent work on convex hulls and Delaunay ....
Teller, S. 1994. Personal communication.
The Quickhull Algorithm for Convex Hulls - Barber, Dobkin, Huhdanpaa (1995) (89 citations) (Correct)
.... ridges of the lower convex hull is the Delaunay triangulation of the original points [9] The intersection of halfspaces about the origin is equivalent to the convex hull of the points in dual space [39] To determine the intersection of halfspaces: locate an interior point by linear programming [43], translate the interior point to the origin, transform halfspaces into points by dividing offsets into coefficients, and compute the convex hull. Via the duality transform, each facet of the convex hull defines a point of intersection of the halfspaces. Recent work on convex hulls and Delaunay ....
S. Teller. Personal communication, 1994.
Wavelet Algorithms For Illumination Computations - Schröder (1994) (Correct)
....10 lies in the fact that it characterizes the sparsity of the associated matrix. Instead of n 2 interactions we have approximately 10 # n interactions, which supports our claim that the resultant algorithm is linear in the number of elements. An informal survey amongst users of the system [65, 23] has shown that these factors vary from about 9 to 10 linkups on average per element. These observations were made across di#erent scenes (including scenes with significant occlusion) di#erent order basis functions (constant to cubic) and di#erent # parameters. In practice we will not limit the ....
Teller, S. personal communication, 1994.
A Survey of Aspect Graphs - Schiffenbauer (2001) (Correct)
No context found.
Teller S., Personal communication, 2000.
Genetically Optimizing the Speed of Programs Evolved to Play.. - Siegel, Chaffee (1996) (1 citation) (Correct)
No context found.
Teller, A. (1994c). Personal communication.
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