Register | Log in | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

euclid's comp-geom [3 articles]

Recent papers added to euclid's library classified by the tag comp-geom. You can also see everyone's comp-geom.
  • Realizability of delaunay triangulations
    Information Processing Letters, Vol. 33, No. 6. (10 February 1990), pp. 283-287.
    by Michael B Dillencourt
    posted to comp-geom by euclid on 2005-12-19 05:32:53 as ** along with 4 groups Algorithms metric_embeddings TCS Polytopes
  • Delaunay graphs are almost as good as complete graphs
    Discrete Comput. Geom., Vol. 5, No. 4. (July 1990), pp. 399-407.
    by David P Dobkin, Steven J Friedman, Kenneth J Supowit
    posted to comp-geom by euclid on 2005-12-14 21:45:06 as ** along with 1 person and 4 groups ansobol Algorithms metric_embeddings TCS Polytopes
  • There is a planar graph almost as good as the complete graph
    (1986), pp. 169-177.
    by P Chew
    posted to comp-geom by euclid on 2005-12-14 21:44:25 as ** along with 1 person and 4 groups ansobol Algorithms metric_embeddings TCS Polytopes
    • Note: You may cite this page as: http://www.citeulike.org/user/euclid/tag/comp-geom

    RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.