94 search results - page 9 / 19 » Minimum-Perimeter Intersecting Polygons |
COMPGEOM
2007
ACM
15 years 1 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
ICCSA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
118
click to vote
SIGGRAPH
1995
ACM
15 years 1 months ago
1995
ACM
A method is presented to broaden implicit surface modeling. The implicit surfaces usually employed in computer graphics are two dimensional manifolds because they are defined by r...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
SI3D
2005
ACM
15 years 3 months ago
2005
ACM
This paper presents a technique for mapping relief textures onto arbitrary polygonal models in real time. In this approach, the mapping of the relief data is done in tangent space...