Sciweavers

70 search results - page 4 / 14
» Circular Separability of Polygons
Sort
View
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
14 years 10 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri
VISUALIZATION
2000
IEEE
15 years 1 months ago
Bicubic subdivision-surface wavelets for large-scale isosurface representation and visualization
We introduce a new subdivision-surface wavelet transform for arbitrary two-manifolds with boundary that is the first to use simple lifting-style filtering operations with bicubi...
Martin Bertram, Mark A. Duchaineau, Bernd Hamann, ...
BIOINFORMATICS
2006
130views more  BIOINFORMATICS 2006»
14 years 9 months ago
Memory efficient folding algorithms for circular RNA secondary structures
A small class of RNA molecules, in particular the tiny genomes of viroids, are circular. Yet most structure prediction algorithms handle only linear RNAs. The most straightforward ...
Ivo L. Hofacker, Peter F. Stadler
ISVC
2009
Springer
15 years 3 months ago
A Real-Time Road Sign Detection Using Bilateral Chinese Transform
We present a real-time approach for circular and polygonal road signs detection1 in still images, regardless of their pose and orientation. Object detection is done using a pairwis...
Rachid Belaroussi, Jean-Philippe Tarel
JCT
2006
80views more  JCT 2006»
14 years 9 months ago
Extending precolorings to circular colorings
Fix positive integers k , d , k, d such that k /d > k/d 2. If P is a set of vertices in a (k, d)-colorable graph G, and any two vertices of P are separated by distance at leas...
Michael O. Albertson, Douglas B. West