Computational Geometry: Algorithms and Applications, Second Edition

726 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

The spatial skyline queries (2006, methodology): “We also used the Graham Scan algorithm [3] for convex hull computation in both VS and VCS.”
Kinodynamic RRT*: Asymptotically optimal motion planning for robots with linear dynamics (2013, methodology): “This is because the benefit of using a k-d tree diminishes with increasing dimension of the space [3], and because of the overhead of computing the bounding box of the reachable sets (see Section V-C).”
Differentiable Convex Optimization Layers (2019, background): “We focus on convex optimization because it is a powerful modeling tool, with applications in control [20, 16, 71], finance [57, 19], energy management [63], supply chain [17, 15], physics [51, 8], computational geometry [73], aeronautics [48], and circuit design [47, 21], among other fields.”
Distributed Control of Robotic Networks (2009, background): “The inclusions in fact (i) are taken from Jaromczyk and Toussaint [1992], de Berg et al. [2000]. The proof of the first inclusion in fact (ii) is as follows.”
Context preserving dynamic word cloud visualization (2010, unknown): “We perform Delaunay Triangulation [7] on the word positions to obtain the mesh which can be denoted as an initial graph G= (V,E).”