J-D. Boissonnat and J. Snoeyink. Efficient algorithms for line and curve segment intersection using restricted predicates. Comput. Geom. Theory Appl., 16(1), 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Optimal and Suboptimal Robust Algorithms for Proximity Graphs - Ferran Hurtado Giuseppe (Correct)
.... literature relies on the computation of the Delaunay triangulation which may require an arithmetic precision four times the one used to represent the input data [5] References where the performance of geometric computations is measured also in terms of the required arithmetic precision include [2, 3, 4, 16]. The remainder of the paper is organized as follows. Preliminaries are in Section 2. A unifying approach to the computation of fi skeletons and fl graphs is presented in Section 3. In the same section the robust algorithm for Gabriel graphs is described. Section 4 deals with the computation of ....
J.-D. Boissonnat and J. Snoeyink. Efficient algorithms for line and curve segment intersection using restricted predicates. Comput. Geom. Theory Appl., 16(1) 35--52, 2000. 13
Reporting Intersections among Thick Objects - Vigneron (2002) (Correct)
....[8] Here we give a practical algorithm too, but for different types of objects, in particular we do not require them to be axis parallel boxes, but we put restrictions on their volume and diameter. For curve segments intersection, robustness problems led to the design of low degree algorithms [3, 4, 5], however an Omega Gamma n p k) lower bound was proven [3] in this context. Our result shows that it is possible to get around this lower bound, and obtain an efficient low degree algorithm for curved objects, if we make assumptions on their volume and diameter. 2 The algorithm We consider a ....
....of objects, in particular we do not require them to be axis parallel boxes, but we put restrictions on their volume and diameter. For curve segments intersection, robustness problems led to the design of low degree algorithms [3, 4, 5] however an Omega Gamma n p k) lower bound was proven [3] in this context. Our result shows that it is possible to get around this lower bound, and obtain an efficient low degree algorithm for curved objects, if we make assumptions on their volume and diameter. 2 The algorithm We consider a set E of n objects in R , where d is constant. Each object ....
J.-D. Boissonnat and J. Snoeyink. Efficient algorithms for line and curve segment intersection using restricted predicates. Comput. Geom. Theory Appl., 16(1):35--52, 2000.
An Elementary Algorithm for Reporting Intersections of.. - Boissonnat, Vigneron (2002) (2 citations) Self-citation (Boissonnat) (Correct)
No context found.
J-D. Boissonnat and J. Snoeyink. Efficient algorithms for line and curve segment intersection using restricted predicates. Comput. Geom. Theory Appl., 16(1), 2000.
An Elementary Algorithm for Reporting Intersections of.. - Boissonnat, Vigneron (2002) (2 citations) Self-citation (Boissonnat) (Correct)
....[11] we consider the degree of the predicates as an additional measure of the complexity of problems and algorithms, and intend to elucidate the relationship between time complexity and degree of the predicates. Related research can be found in Knuth s seminal work [10] and in some recent papers [8, 4, 3]. In this paper, we consider the problem of reporting the k intersecting pairs among a set of n monotone curve segments. We address the red blue case, where this set is partitioned into two subset of non intersecting segments. This problem can be solved in optimal O(n log n k) time [5, 7, 1] ....
....the abscissae of two intersection points or to locate an intersection point with respect to a vertical slab. These predicates have a degree and an algebraic complexity that are usually higher than the intersection predicate : this is in particular the case for line segments and circle segments [3]. Our algorithms only use the intersection predicate and two other simple predicates : the predicate that sorts two points by abscissae, and the predicate that says if a point is below, on, or above a segment. In particular, we do not compute the arrangement nor the trapezoidal map of the ....
[Article contains additional citation context not shown here]
J.-D. Boissonnat and J. Snoeyink. Efficient algorithms for line and curve segment intersection using restricted predicates. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 370--379, 1999.
A Computational Basis for Conic Arcs and Boolean.. - Berberich.. (2002) (4 citations) (Correct)
No context found.
J.-D. Boissonnat and J. Snoeyink. Efficient algorithms for line and curve segment intersection using restricted predicates. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 370--379, 1999.
Intersecting Red and Blue Line Segments in . . . - Mantler (2001) (Correct)
No context found.
J.-D. Boissonnat and J. Snoeyink. Efficient algorithms for line and curve segment intersection using restricted predicates. In Pvoc. of the 15th Annual ACM Symposium on Computational Geometw, pages 370 379, 1999.
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