17 search results - page 1 / 4 » Polygon Properties Calculated from the Vertex Neighborhoods |
COMPGEOM
1987
ACM
13 years 8 months ago
1987
ACM
Calculating properties of polyhedra given only the set of the locations and neighborhoods of the vertices is easy. Possible properties include volume, surface area, and point cont...
CONIELECOMP
2011
IEEE
12 years 8 months ago
2011
IEEE
This work focuses on developing systems of blocks in SIMULINK and VHDL to reuse on design of applications involving the recognition of polygonal objects. Usage of this work reduce...
VISUALIZATION
1998
IEEE
13 years 8 months ago
1998
IEEE
Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must retain and use information about the original model during the simplification ...
CORR
2012
Springer
12 years 8 days ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
JAL
2006
13 years 4 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...