F. Nielsen and M. Yvinec. An output-sensitive convex hull algorithm for planar objects. Technical Report 2575, Institut nationale de recherche en informatique at en automatique, INRIA Sophia-Antipolis, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Deterministic Algorithms for 2-d Convex Programming and 3-d Online .. - Chan (1997) (Correct)
....: If the functions in H are linear, then the problem can of course be solved in linear time. Reichling [24] described a linear time algorithm for the quadratic case. The dual of the problem is equivalent to finding a bridge [16] of a convex hull of k planar convex objects. Nielsen and Yvinec [22] gave an O(k) time algorithm for the case when two objects may intersect at most a constant number of times. We know of no nontrivial deterministic algorithm for the general case. Chazelle and Matousek [7] specifically pointed out that their derandomization technique is not applicable to this ....
F. Nielsen and M. Yvinec. An output-sensitive convex hull algorithm for planar objects. Research Report 2575, INRIA, Sophia-Antipolis, France, 1995.
Fast Stabbing of Boxes in High Dimensions - Nielsen (1996) (4 citations) Self-citation (Nielsen) (Correct)
....Nielsen is no longer true in higher dimensions. For example, in dimension 2, we may have c (S) 3 2 b (S) 2. 2 Getting an output sensitive algorithm The methodology consists in grouping the intervals into groups and to preprocess each group in order to answer eOEciently queries [Cha95, NY95] Typically, our queries are of two kinds: iwhat are the intervals stabbed by a point p j and iwhich interval has the rightmost left endpoint j. Moreover, we must be able to remove some of these intervals at some steps. We use the interval tree of McCreight [McC80, PS85] as the data structure for ....
F. Nielsen and M. Yvinec. Output-Sensitive Convex Hull Algorithms of Planar Convex Objects. Research Report, INRIA, BP93, 06902 So phia-Antipolis, France, 1995.
Jacobi Curves: Computing the Exact Topology of Arrangements of.. - Wolpert (2000) (Correct)
No context found.
F. Nielsen and M. Yvinec. An output-sensitive convex hull algorithm for planar objects. Technical Report 2575, Institut nationale de recherche en informatique at en automatique, INRIA Sophia-Antipolis, 1995.
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