DCG 2000 - PDF Preprint Papers

DCG 2000

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DCG-2000 Paper

click to vote

DCG
2000

104views more DCG 2000»

Efficient Algorithms for Approximating Polygonal Chains

13 years 11 months ago

Download biogeometry.duke.edu

We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...

Pankaj K. Agarwal, Kasturi R. Varadarajan

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	104	Efficient Algorithms for Approximating Polygonal Chains	claim
2	94	Finding Small Triangulations of Polytope Boundaries Is Hard	claim
3	90	On the Cocircuit Graph of an Oriented Matroid	claim
4	84	Convex and Linear Orientations of Polytopal Graphs	claim
5	79	Mutation Polynomials and Oriented Matroids	claim
6	76	A Central Limit Theorem for Convex Chains in the Square	claim
7	75	Cutting Polytopes and Flag f-Vectors	claim
8	67	A Theorem on Higher Bruhat Orders	claim
9	59	Regression Depth and Center Points	claim
10	59	Face Numbers of Scarf Complexes	claim
11	59	Decomposing the Secondary Cayley Polytope	claim
12	57	On the Generation of Oriented Matroids	claim
13	55	Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes	claim
14	53	Integer Optimization on Convex Semialgebraic Sets	claim
15	45	Relations in SO (3) Supported by Geodetic Angles	claim
16	44	Icosahedra Constructed from Congruent Triangles	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers