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

cjones's computational_geometry [25 articles]

Recent papers added to cjones's library classified by the tag computational_geometry. You can also see everyone's computational_geometry.
  • Separation and approximation of polyhedral objects
    Computational Geometry, Vol. 5, No. 2. (September 1995), pp. 95-114.
    by Joseph S Mitchell, Subhash Suri
  • Surface Approximation and Geometric Partitions
    SIAM Journal on Computing, Vol. 27, No. 4. (1998), pp. 1016-1035.
    by Pankaj K Agarwal, Subhash Suri
  • Hinging hyperplanes for regression, classification, and function approximation
    Information Theory, IEEE Transactions on, Vol. 39, No. 3. (1993), pp. 999-1013.
    by L Breiman
  • Parameterized Polyhedra and Their Vertices
    International Journal of Parallel Programming, Vol. V25, No. 6. (1 December 1997), pp. 525-549.
    by Vincent Loechner, Doran K Wilde
  • Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron
    Computational Geometry, Vol. 8, No. 1. (June 1997), pp. 1-12.
    by Komei Fukuda, Thomas M Liebling, Francois Margot
  • Counting faces of randomly-projected polytopes when the projection radically lowers dimension
    (15 Jul 2006)
    by David L Donoho, Jared Tanner
  • More output-sensitive geometric algorithms
    Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on (1994), pp. 695-702.
    by KL Clarkson
  • Algorithms for minimum volume enclosing simplex in <inline-equation> <f> <sc>R</sc><sup>3</sup></f> </inline-equation>
    (2000), pp. 500-509.
    by Yunhong Zhou, Subhash Suri
  • Query-Sensitive Ray Shooting
    International Journal of Computational Geometry and Applications, Vol. 7, No. 4. (1997), pp. 317-347.
    by Joseph SB Mitchell, David M Mount, Subhash Suri
  • Practical issues on the projection of polyhedral sets
    Annals of Mathematics and Artificial Intelligence, Vol. 6, No. 4. (December 1992), pp. 295-315.
    by Tien Huynh, Catherine Lassez, Jean-Louis Lassez
  • On the worst-case complexity of the silhouette of a polytope
    (2003), pp. 51-55.
    by H Alt, M Glisse, Goaoc
  • Qualitative Theorem Proving in Linear Constraints
    (March 2000)
    by V Chandru, C Lassez, JL Lassez
    posted to computational_geometry projection by cjones on 2006-04-05 13:55:08 as read along with 1 group IFA_Hybrid
  • User's Manual. Reference of the Geometric Bounding Toolbox
  • Primal-Dual Methods for Vertex and Facet Enumeration
    Discrete and Computational Geometry, Vol. 20 (1998), pp. 333-357.
    posted to computational_geometry convex_hull by cjones on 2006-04-05 13:55:08 as read along with 1 group IFA_Hybrid
  • hull 1.0
    by KL Clarkson
    posted to computational_geometry convex_hull by cjones on 2006-04-05 13:55:08 as read along with 1 group IFA_Hybrid
  • porta
    (March 1997)
    posted to computational_geometry convex_hull by cjones on 2006-04-05 13:55:08 as read along with 1 group IFA_Hybrid
  • Double description method revisited
    Vol. 1120 (1996), pp. 91-111.
    by K Fukuda, A Prodon
    edited by M Deza, R Euler, I Manoussakis
    posted to computational_geometry convex_hull by cjones on 2006-04-05 13:55:08 as read along with 1 group IFA_Hybrid
  • lrs: A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm
    (2000), pp. 177-198.
    by D Avis
    edited by G Kalai, G Ziegler
    posted to computational_geometry convex_hull by cjones on 2006-04-05 13:55:08 as read along with 1 group IFA_Hybrid
  • The quickhull algorithm for convex hulls
    ACM Trans. Math. Softw., Vol. 22, No. 4. (1996), pp. 469-483.
    by CB Barber, DP Dobkin, H Huhdanpaa
    posted to computational_geometry convex_hull by cjones on 2006-04-05 13:55:08 as read along with 1 group IFA_Hybrid
  • Reverse Search for Enumeration
    Discrete Applied Math, Vol. 65 (1996), pp. 21-46.
    by D Avis, K Fukuda
  • A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
    Discrete and Computational Geometry, Vol. 8 (1992), pp. 295-313.
    by D Avis, K Fukuda
  • Primal-Dual Methods for Vertex and Facet Enumeration
    Discrete and Computational Geometry, Vol. 20 (1998), pp. 333-357.
  • Incremental Convex Hull Algorithms Are Not Output Sensitive
    Discrete and Computational Geometry, Vol. 21, No. 1. (January 1999), pp. 57-68.
    by D Bremner
  • Enumerating extreme points in higher dimensions
    (1995), pp. 562-570.
    edited by EW Mayer, C Puech
  • Computation of Voronoi Diagrams and Delaunay Triangulation via Parametric Linear Programming
    No. AUT04-03. (2004)
    by S Rakovic, P Grieder, CN Jones
  • Note: You may cite this page as: http://www.citeulike.org/user/cjones/tag/computational_geometry

    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.