Sciweavers

256 search results - page 20 / 52
» Short trees in polygons
Sort
View
IADIS
2003
13 years 10 months ago
A New Key Distribution Scheme for Secure Multicast Communications
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...
Martin St-Amand, Boucif Amar Bansaber, Dominique S...
ICPP
2005
IEEE
14 years 2 months ago
Design and Implementation of Overlay Multicast Protocol for Multimedia Streaming
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...
Thilmee M. Baduge, Akihito Hiromori, Hirozumi Yama...
COMPGEOM
2005
ACM
13 years 10 months ago
The Visibility-Voronoi Complex and Its Applications
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...
Ron Wein, Jur P. van den Berg, Dan Halperin
COMPGEOM
2008
ACM
13 years 10 months ago
Circular partitions with applications to visualization and embeddings
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 ...
Krzysztof Onak, Anastasios Sidiropoulos
WALCOM
2007
IEEE
82views Algorithms» more  WALCOM 2007»
13 years 9 months ago
Methods for Searching Mutual Visible-Intervals on Moving Object
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...
Yoshiyuki Kusakari, Yuta Sugimoto, Junichi Notoya,...