On the Complexity of Optimization Problems for 3-Dimensional Convex Polyhedra and Decision Trees (1995)

Cached

Download Links

by Gautam Das , Michael T. Goodrich
Venue:Comput. Geom. Theory Appl
Citations:14 - 0 self

Documents Related by Co-Citation

382 HOW TO DRAW A Graph – W. T. Tutte - 1963
11 Minimum vertex hulls for polyhedral domains – G Das, D Joseph - 1992
30 The complexity of minimum convex nested polyhedra – G Das, D Joseph - 1990
30 Separation and Approximation of Polyhedral Objects – Joseph S. B. Mitchell , Subhash Suri - 1993
97 Surface Approximation and Geometric Partitions – Pankaj K. Agarwal, Subhash Suri - 1994
24 On reciprocal figures and diagrams of forces – J C Maxwell
14 Motion and stresses of projected polyhedra – W Whiteley - 1982
6 Existence and uniqueness of packings with specified combinatorics – O Schramm - 1991
6 On the number of spanning trees a planar graph can have – K Buchin, A Schulz - 2010
10 Steinitz representations of polyhedra and the Colin de Verdi̬re number РLaszlo Lovasz - 2000
23 Interpolation and approximation with developable B-spline surfaces – J Hoschek, H Pottmann - 1995
4 On the difficulty of embedding planar graphs with inaccuracies – M Godau - 1994
2 Surface smoothing for enhancement of 3d data using curvature-based adaptive regularization – H Ki, J Shin, J Jung, S Lee, J K Paik - 2004
4 Linear Time Approximation of 3D Convex Polytopes – Mario A. Lopez, Shlomo Reisner - 2001
7 Envelope Surfaces – N Kruithof, G Vegter - 2006
9 Randomized algorithms for geometric optimization problems – Pankaj K. Agarwal, Sandeep Sen - 2001
7 Piecewise developable surface approximation of general NURBS surfaces with global error bounds – J SUBAG, G ELBER
48 A simplified NP-complete satisfiability problem – Craig A Tovey - 1984
15 Surface reconstruction using umbrella filters – U Adamy, J Giesen, M John - 2002