Sciweavers

59 search results - page 3 / 12
» An Associative Static and Dynamic Convex Hull Algorithm
Sort
View
BIRTHDAY
2003
Springer
14 years 3 months ago
Java Applets for the Dynamic Visualization of Voronoi Diagrams
We discuss the design of Java applets that visualize how the Voronoi diagram of n points continuously changes as individual points are moved across the plane, or as the underlying...
Christian Icking, Rolf Klein, Peter Köllner, ...
CCCG
1993
13 years 11 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
VMV
2008
151views Visualization» more  VMV 2008»
13 years 11 months ago
Adaptive surface decomposition for the distance computation of arbitrarily shaped objects
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
Marc Gissler, Matthias Teschner
IWPEC
2004
Springer
14 years 3 months ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 9 months ago
Minimizing weighted sum delay for one-to-many file transfer in peer-to-peer networks
Abstract-- This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weig...
Bike Xie, Mihaela van der Schaar, Richard D. Wesel