2980 search results - page 202 / 596 » Computational Geometry |
147
Voted
COMPGEOM
1996
ACM
15 years 7 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
136
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
126
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
127
Voted
DAGSTUHL
2010
15 years 5 months ago
2010
Mesh optimization of 2D and 3D triangulations is used in multiple applications extensively. For example, mesh optimization is crucial in the context of adaptively discretizing geo...
122
Voted
VISUALIZATION
1998
IEEE
15 years 7 months ago
1998
IEEE
We consider interpolation between keyframe hierarchies. We impose a set of weak constraints that allows smooth interpolation between two keyframe hierarchies in an animation or, m...