Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

51

COMPGEOM
2007
ACM

favoriteEmaildiscussreport

90views Discrete Geometry» more COMPGEOM 2007»

Approximating the centroid is hard

15 years 1 months ago

Approximating the centroid is hard

Download www.cse.ohio-state.edu

Luis Rademacher

Real-time Traffic

COMPGEOM 2007 | Discrete Geometry |

claim paper

Related Content

» Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening

» Complexity of Approximating the Vertex Centroid of a Polyhedron

» Mesh clustering by approximating centroidal Voronoi tessellation

» Approximating r pCentroid on a Path

» Approximating centroids for the maximum intersection of spherical polygons

» Approximation algorithms and hardness of integral concurrent flow

» On New Approaches of Assessing Network Vulnerability Hardness and Approximation

» Approximation algorithms and hardness of the kroute cut problem

» Evaluation of Capacitor Ratios in Automated Accurate CommonCentroid Capacitor Arrays

Post Info
More Details (n/a)

Added	14 Aug 2010
Updated	14 Aug 2010
Type	Conference
Year	2007
Where	COMPGEOM
Authors	Luis Rademacher

Comments (0)