256 search results - page 20 / 52 » Short trees in polygons |
106
click to vote
IADIS
2003
15 years 1 months ago
2003
In this short paper, we propose a new key management architecture for Multicast communications. This architecture combines the complementary variable approach with hashed keys and...
ICPP
2005
IEEE
15 years 5 months ago
2005
IEEE
In this paper, we propose a new protocol called Shared Tree Streaming (or STS in short) protocol that is designed for interactive multimedia streaming applications. STS is a decen...
109
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
124
click to vote
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
WALCOM
2007
IEEE
15 years 28 days ago
2007
IEEE
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...