100 search results - page 1 / 20 » Planar Visibility Counting |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
COCOON
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
ICCSA
2007
Springer
13 years 11 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...
IJCGA
2007
13 years 4 months ago
2007
Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering inform...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...