CCCG 2004 - PDF Preprint Papers

CCCG 2004

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CCCG-2004 Paper

click to vote

CCCG
2004

147views Computational Geometry» more CCCG 2004»

Continuous foldability of polygonal paper

14 years 25 days ago

Download www.williams.edu

We prove that any given well-behaved folded state of a piece of paper can be reached via a continuous folding process starting from the unfolded paper and ending with the folded st...

Erik D. Demaine, Satyan L. Devadoss, Joseph S. B. ...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	147	Continuous foldability of polygonal paper	claim
2	146	On computing enclosing isosceles triangles and related problems	claim
3	108	On the number of line tangents to four triangles in three-dimensional space	claim
4	99	Local properties of geometric graphs	claim
5	96	Edge-tracing algorithm for euclidean voronoi diagram of 3d spheres	claim
6	93	On corners of objects built from parallelepiped bricks	claim
7	90	Algorithms for bivariate zonoid depth	claim
8	84	Banana spiders: A study of connectivity in 3d combinatorial rigidity	claim
9	84	Three-dimensional 1-bend graph drawings	claim
10	83	Surface reconstruction, one triangle at a time	claim
11	83	Meshless surface reconstruction by kernel clustering	claim
12	83	Efficient polygon enclosure algorithms for device extraction from VLSI layouts	claim
13	81	Encompassing colored crossing-free geometric graphs	claim
14	79	Simultaneous edge flips for convex subdivisions	claim
15	77	Making contour trees subdomain-aware	claim
16	77	Transformations and algorithms for least sum of squares hypersphere fitting	claim
17	77	Approximating smallest enclosing disks	claim
18	77	The box mover problem	claim
19	76	The fitting line problem in the laguerre geometry	claim
20	75	Optimistic shortest paths on uncertain terrains	claim
21	74	Computing nice sweeps for polyhedra and polygons	claim
22	74	When can a graph form an orthogonal polyhedron?	claim
23	73	An anisotropic cardinality bound for triangulations	claim
24	73	Separating points by axis-parallel lines	claim
25	72	Tiling layouts with dominoes	claim
26	70	Computing the set of all distant horizons of a terrain	claim
27	67	On some monotone path problems in line arrangements	claim
28	67	On sequential triangulations of simple polygons	claim
29	67	Using bistellar flips for rotations in point location structures	claim
30	65	A fast algorithm for updating a labeling to avoid a moving point	claim
31	64	Degree-bounded minimum spanning trees	claim
32	61	Tries for combined text and spatial data range search	claim
33	59	On multi-level k-ranges for range search	claim
34	54	Unfolding polyhedral bands	claim
35	52	Approximating contact-area of supports in layered manufacturing	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers