H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Efficient Algorithms for Geometric Optimization - Agarwal, Sharir (1998) (9 citations) (Correct)
....2.2 An example: The slope selection problem As an illustration, consider the slope selection problem: Given a set of n points in the plane and an integer k , determine a segment connecting two input points that has the k th smallest slope among all such segments. Using the duality transform [108], we can formulate this problem as follows: We are given a set L of n nonvertical lines in the plane and an integer 1 k , and we wish to find an intersection point between two lines of L that has the k th smallest x coordinate. We assume, for simplicity, general position of the lines, so ....
....of L that has the k th smallest x coordinate. We assume, for simplicity, general position of the lines, so that no three lines are concurrent, and no two intersection points have the same x coordinate. We are thus seeking the k th leftmost vertex of the arrangement A(L) of the lines in L; see [108, 254] for more details concerning arrangements. We define P( to be true if the x coordinates of at most k vertices of A(L) are smaller than or equal to . Obviously, P( is monotone, and , the maximum value of for which P( is true, is the x coordinate of the desired vertex. After having ....
[Article contains additional citation context not shown here]
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.
Geometric Clusterings - Capoyleas, Rote, Woeginger (1991) (15 citations) (Correct)
....chordale of the two disks. It is defined for any pair of non concentric disks. If we partition the plane by assigning every point to the disk D i for which its power d(x, M i ) is minimal, we get the so called power diagram (cf. Aurenhammer [2] Imai, Iri, and Murota [12] or Edelsbrunner [7], section 13.6) It is known that the power diagram is a dissection of the plane into (at most) k convex polygonal regions, very much like in the case of Voronoi diagrams, which are a special case of power diagrams where all radii are equal. Since for each point p P , d(x, M i ) 0 for ....
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer Verlag, 1987.
Two Algorithms for Nearest-Neighbor Search in High Dimensions - Kleinberg (1997) (91 citations) (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, 1987.
Computational Geometry and Facility Location - Jean-Marc Robert Godfried (Correct)
No context found.
Edelsbrunner, H., Algorithms in Combinatorial Geometry, Springer-Verlag, 1987.
Algorithms for Bivariate Medians and a - Fermat-Torricelli Problem For (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Berlin, 1987. 14
Combinatorial Properties of One-Dimensional Arrangements - Frederic Cazals Imagis-Imag (1997) (Correct)
No context found.
Edelsbrunner, H. (1986). Algorithms in Combinatorial Geometry. Springer-Verlag.
Harmonic Functions for Quadrilateral Remeshing of.. - Dong, Kircher, Garland (2005) (2 citations) (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
Regular Triangulations of Dynamic Sets of Points - Marc Vigo Uria (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, 1987.
Furthest Site Abstract Voronoi Diagrams - Mehlhorn, Meiser, Rasch (4 citations) (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, 1987.
Spectral Partitioning Works:Planar graphs and finite element.. - Spielman, Teng (1996) (34 citations) (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, NY, 1987.
On Simulated Annealing and the Construction of Linear Spline.. - Kreylos, Hamann (2001) (3 citations) (Correct)
No context found.
Edelsbrunner, H., Algorithms in Combinatorial Geometry (1987), Springer -Verlag, New York, NY
Unknown - Ist- Effective Computational (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer Verlag, Heidelberg, 1987.
Efficiency-Quality Tradeoffs for Vector Score Aggregation - Singitham, Mahabhashyam.. (2004) (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, 1987.
On the Number of Cells Defined by a Family of Polynomials.. - Basu, Pollack, Roy (6 citations) (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. SpringerVerlag, Berlin, 1987.
The Power Crust - Amenta, Choi, Kolluri (2001) (11 citations) (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer Verlag, (1987). See pages 327--328.
Indexing Constraint Databases by Using a Dual Representation - Bertino Catania.. (1999) (1 citation) (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. In EATCS Monographs on Theoretical Computer Science, Vol. 10. 1987.
Planning Algorithms - LaValle (2004) (3 citations) (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
Discrete Applied Mathematics 92 (1999) 91--110 - Planet Software Package (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Berlin, 1987.
Computing the Center of Planar Point Sets - Matousek (2000) (21 citations) (Correct)
No context found.
H. Edelsbrunner. Algorithms in combinatorial geometry. Springer, 1987.
Constructing Planar Cuttings in Theory and Practice - Har-Peled (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.
Hierarchic Voronoi Skeletons - Ogniewicz, Kübler (1995) (27 citations) (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Berlin, (1987).
Computational Geometry Techniques for Point Cloud Processing, Part.. - Rao (2001) (Correct)
No context found.
Edelsbrunner H. Algorithms in Combinatorial geometry. Springer-verlag, 1987.
Improved Bounds for Incidences and Complexity - Of Many Faces (2000) (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer Verlag, Heidelberg 1987.
Computational Geometry Techniques for Point Cloud Processing, Part I .. - R (2001) (Correct)
No context found.
Edelsbrunner H. Algorithms in Combinatorial geometry. Springer-verlag, 1987. 50
An Optimal Randomized Algorithm for Maximum Tukey Depth - Chan (2004) (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
On Levels in Arrangements of Curves, II: A Simple Inequality and.. - Chan (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
Lenses in Arrangements of Pseudo-circles and Their - Applications Pankaj Agarwal (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer Verlag, Heidelberg, 1987.
Long Monotone Paths in Line Arrangements - Balogh, Regev, Smyth, Steiger.. (2003) (1 citation) (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
Approximate Nearest Neighbor Algorithms for - Hausdorff Metrics Via (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Spinger Verlag, 1987.
The Complexity of Many Faces in the Overlay of Arrangements - Har-Peled (1995) (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, 1987. 38
A Survey of Aspect Graphs - Schiffenbauer (2001) (Correct)
No context found.
Edelsbrunner H., Algorithms in Combinatorial Geometry, Springer-Verlag, 1987.
Monotone Paths in Line Arrangements - With Small Number (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.
Cue Integration Using Affine Arithmetic and Gaussians - Goldenstein, Vogler, Metaxas (Correct)
No context found.
Edelsbrunner, H.: Algorithms in combinatorial geometry. Springer-Verlag (1987)
Dynamic Planar Convex Hull Operations in Near-Logarithmic.. - Chan (2000) (17 citations) (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
Efficient State Updates for Key Management - Pinkas (2001) (2 citations) (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, Germany, 1987.
Geometric Pattern Matching - In Dimensional Space (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, Germany, 1987.
On the Number of Congruent Simplices in a Point Set - Agarwal, Sharir (2002) (2 citations) (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.
Algorithmic, Geometric and Graphs Issues in Wireless Networks - Li (2002) (1 citation) (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, 1987.
On the Complexity of One-shot Translational Separability - Fabian Schwarzer Achim (2001) (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer, Heidelberg, 1987.
On Levels in Arrangements of Lines, Segments, Planes.. - Agarwal, Aronov, Chan, .. (2001) (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg 1987.
Smooth-Surface Reconstruction in Near-Linear Time - Funke, Ramos (2002) (8 citations) (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer Verlag, Heidelberg, 1987.
Metrika manuscript No. - Will Be Inserted (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
A Multi-Resolution Topological Representation for.. - De Floriani.. (2002) (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
Estimating The Number Of Vertices Of A Polyhedron - Avis, Devroye (2000) (13 citations) (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Berlin, 1987.
Coverage in Wireless Ad-hoc Sensor Networks - Li, Wan, Frieder (2002) (5 citations) (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, 1987.
Algorithms for Bivariate Medians and a.. - Aloupis.. (2002) (1 citation) (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Berlin, 1987. 14
Three-Dimensional Delaunay Mesh Generation - Cheng, Poon (2004) (Correct)
No context found.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
Counting Circular Arc Intersections - Marco (1991) (5 citations) (Correct)
No context found.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.
Noise-Tolerant Distribution-Free Learning of General.. - Bshouty, Goldman, al. (1996) (12 citations) (Correct)
No context found.
Herbert Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, New York, 1987.
Probing a Set of Hyperplanes by Lines and Related Problems - Aoki, Imai, Imai, Rappaport (1993) (2 citations) (Correct)
No context found.
Edelsbrunner, H., "Algorithms in Combinatorial Geometry," Springer-Verlag, 1987.
First 50 documents Next 50
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