MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

4 documents found, showing 1 through 4.

ATOM

A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions
by Raimund Seidel — 1991 — Comput. Geom. Theory Appl
…A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions…
Cited by 81 (2 self) – Add To MetaCart

apply an optimal serial algorithm to those subproblems with no more than segments, and apply
by Analysis It Is
… Computitg, 1988. R. Seidel. A simple and fast incremental randomized algorithm for computing trapezoidal…
Add To MetaCart

Decompositional Problems in Computational Geometry
by Leonidas Palios — 1992
…, A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions…
Cited by 1 (0 self) – Add To MetaCart

Bibliography
by Aga Agarwal Geometric, The Dimacs Special Year, Pages American Mathematical Society, Aahps P. K. Agarwal, B. Aronov, Ahpsv P. K. Agarwal, S. Har-peled, S. Har-peled, M. Sharir
… and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating…
Add To MetaCart

Showing 1 through 4.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB