Sciweavers

969 search results - page 9 / 194
» A New Metric Between Polygons and How to Compute it
Sort
View
COMPGEOM
2007
ACM
15 years 3 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
COMPGEOM
1990
ACM
15 years 3 months ago
Minimum-Link Paths Among Obstacles in the Plane
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
Joseph S. B. Mitchell, Günter Rote, Gerhard J...
AUSAI
1999
Springer
15 years 4 months ago
Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...
Edmund K. Burke, Graham Kendall
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
15 years 1 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
ICASSP
2009
IEEE
14 years 9 months ago
A new perceptual quality metric for compressed video
This paper presents a new video quality metric for automatically estimating the perceptual quality of compressed video sequences. Distortion measures such as the mean squared erro...
Abharana Bhat, Iain E. Garden Richardson, C. Sampa...