Computational Geometry Column 40

Details Computational Geometry Column 40 Computational Geometry Column 40

2000-10-31

arxiv.org/abs/cs/0010039v1

Computer Science

Computational Geometry

3 pages; 4 figures

Scientific paper

It has recently been established by Below, De Loera, and Richter-Gebert that
finding a minimum size (or even just a small) triangulation of a convex
polyhedron is NP-complete. Their 3SAT-reduction proof is discussed.

Affiliated with

Also associated with

No associations

Rating

Computational Geometry Column 40 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computational Geometry Column 40, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational Geometry Column 40 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-446332