Back to Results
First PageMeta Content
Topology / Pseudotriangle / Connectivity / NP-complete / Delaunay triangulation / Point set triangulation / Triangulation / Geometry / Mathematics


New results on Pseudo-triangulations with low vertex degree Andr´e Schulz∗ constrained pseudo-triangulations this question is NPcomplete. Even though for every point set there exists a pseudotriangulations with degree
Add to Reading List

Document Date: 2005-07-31 13:56:02


Open Document

File Size: 96,94 KB

Share Result on Facebook

City

Berlin / /

Country

Germany / /

/

Organization

Institut f¨ / /

/

SocialTag