279 search results - page 3 / 56 » Implicit Convex Polygons |
CCCG
2006
13 years 9 months ago
2006
We study the relationship between the interior angles of a convex polygon and the lengths of external watchman routes.
IPL
2000
13 years 7 months ago
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
GMP
2002
IEEE
14 years 17 days ago
2002
IEEE
Implicit surfaces in 3D geometric modeling are limited to two manifolds because the corresponding implicit fields are usually defined by real-valued functions which bisect space...
VISUALIZATION
2002
IEEE
14 years 16 days ago
2002
IEEE
In this paper we present a generalization of the geometry coder by Touma and Gotsman [34] to polygon meshes. We let the polygon information dictate where to apply the parallelogra...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...