100 search results - page 3 / 20 » Planar Visibility Counting |
COCO
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
ICRA
1999
IEEE
15 years 2 months ago
1999
IEEE
We describe a hybrid planar image-based servo algorithm which, for a simplified planar convex rigid body, converges to a static goal for all initial conditions within the workspac...
JCT
2008
14 years 10 months ago
2008
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these invest...
JGAA
2007
14 years 10 months ago
2007
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...
SI3D
1999
ACM
15 years 2 months ago
1999
ACM
Visibility computation and level of detail modeling are two important components of efficient scenerendering algorithms. Both aim to lessen the graphics load by lowering polygon c...