Sciweavers

2877 search results - page 25 / 576
» The Complexity of Planarity Testing
Sort
View
COMPGEOM
2004
ACM
14 years 1 months ago
On empty convex polygons in a planar point set
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
Rom Pinchasi, Rados Radoicic, Micha Sharir
ESA
2003
Springer
118views Algorithms» more  ESA 2003»
14 years 29 days ago
The Voronoi Diagram of Planar Convex Objects
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
Menelaos I. Karavelas, Mariette Yvinec
TSMC
2008
94views more  TSMC 2008»
13 years 7 months ago
Test Sequencing in Complex Manufacturing Systems
Testing complex manufacturing systems, such as an ASML [1] lithographic machine, takes up to 45% of the total development time of a system. The problem of which tests must be execu...
R. Boumen, I. S. M. de Jong, J. W. H. Vermunt, J. ...
PRESENCE
2002
185views more  PRESENCE 2002»
13 years 7 months ago
EyeTap Devices for Augmented, Deliberately Diminished, or Otherwise Altered Visual Perception of Rigid Planar Patches of Real-Wo
Diminished reality is as important as augmented reality, and both are possible with a device called the Reality Mediator. Over the past two decades, we have designed, built, worn,...
Steve Mann, James Fung
ICSE
2009
IEEE-ACM
14 years 2 months ago
WISE: Automated test generation for worst-case complexity
Program analysis and automated test generation have primarily been used to find correctness bugs. We present complexity testing, a novel automated test generation technique to ...
Jacob Burnim, Sudeep Juvekar, Koushik Sen