Google
Google Scholar
MS Academic Search
CiteSeerX
Semantic Scholar17. Symposium on Computational Geometry 2001: Medford, MA, USA
Diane L. Souvaine:
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, Medford, MA, USA, June 3-5, 2001. ACM 2001, ISBN 1-58113-357-X- Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser:
Enumerating order types for small sets with applications. 11-18 - Sergio Cabello, Mark de Berg, Steven van Dijk, Marc J. van Kreveld, Tycho Strijk:
Schematization of road networks. 33-39 - Regina Estkowski, Joseph S. B. Mitchell:
Simplifying a polygonal subdivision while keeping it simple. 40-49 - Nabil H. Mustafa, Eleftherios Koutsofios, Shankar Krishnan, Suresh Venkatasubramanian:
Hardware-assisted view-dependent map simplification. 50-59 - Mihai Pop, Christian A. Duncan, Gill Barequet, Michael T. Goodrich, Wenjing Huang, Subodh Kumar:
Efficient perspective-accurate silhouette computation and applications. 60-68 - Herbert Edelsbrunner, John Harer, Afra Zomorodian:
Hierarchical morse complexes for piecewise linear 2-manifolds. 70-79 - Francis Lazarus, Michel Pocchiola, Gert Vegter, Anne Verroust:
Computing a canonical polygonal schema of an orientable triangulated surface. 80-89 - Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort:
Box-trees and R-trees with near-optimal query time. 124-133 - Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir:
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. 141-150 - Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell:
Farthest neighbors and center points in the presence of rectangular obstacles. 164-171 - Danny Z. Chen, Xiaobo Hu, Yingping Huang, Yifan Li, Jinhui Xu:
Algorithms for congruent sphere packing and applications. 212-221 - Ewgenij Gawrilow, Michael Joswig:
Polymake: an approach to modular software design in computational geometry. 222-231 - Naoki Katoh, Takeshi Tokuyama:
Notes on computing peaks in k-levels and parametric spanning trees. 241-248 - Matthew J. Katz, Kasturi R. Varadarajan:
A tight bound on the number of geometric permutations of convex fat objects in Rd. 249-251 - Nicola Geismann, Michael Hemmer, Elmar Schömer:
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually! 264-273 - Shankar Krishnan, Mark Foskey, Tim Culver, John Keyser, Dinesh Manocha:
PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation. 274-283 - David P. Dobkin, Ayellet Tal:
Efficient and small representation of line arrangements with applications. 293-301 - Micha Sharir, Emo Welzl:
Balanced lines, halving triangles, and the generalized lower bound theorem. 315-318 - Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin:
2-point site Voronoi diagrams. 323-324
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2016-09-30 20:26 CEST by the dblp team