… The computational geometry community has made many advances in the relatively short (quarter-century)
of the … We gather here a list of open problems in computational geometry (and …

… this column, we consider the cases in which those geometric realizability problems are actually
equivalent to the … We outline the foundations of those results, including a brief overview of …

… the GK S input model is poorly suited to the needs of a windowin g environment. I believe,
however, that the GKS input mode l as defined in the … The original GKS input referenc e model …

… We survey recent results in computational geometry that fall into this model and that strive
to achieve the … The most basic problems in computational geometry concern point sets in …

… the convex hull in three dimensions in O(n log h) time [C1a88], where h is the number of
vertices of the … the input distribution : rather the "expectation is over the random behavior of …

… Call the list of the labels in the order in which a … on the boundary of P immobilize the shape
in the plane if any movement of P in the plane causes at least one point of I to penetrate to the …

… The planar analog is well-known and a cornerstone of computational geometry: the interior
… The situation for spherical polygons is not so straightforward. There are three complications. …

… After an early O(n 5) algorithm [OSB85], an O(n 2 log n) algorithm was developed that used
a technique the authors dubbed the continuous Dijskstra method [MMP87]. This simulates …

… computational geometry in the early 1980's. After merging his and van Leeuwen's list with a
list of Guibas and Stol , and making other updates, he released it to the … , the bibliography is …

… Two of the open problems posed in the first computational geometry column [1] have been
solved . I … The linear-time polygon triangulatio n result I mentioned in [1] has slipped a bit to O(…