Sciweavers

2188 search results - page 167 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
COMPGEOM
2006
ACM
15 years 10 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
VTS
2006
IEEE
101views Hardware» more  VTS 2006»
15 years 10 months ago
Design Optimization for Robustness to Single Event Upsets
Abstract: An optimization algorithm for the design of combinational circuits that are robust to single-event upsets (SEUs) is described. A simple, highly accurate model for the SEU...
Quming Zhou, Mihir R. Choudhury, Kartik Mohanram
JVCIR
2006
104views more  JVCIR 2006»
15 years 4 months ago
Color image decomposition and restoration
Meyer has recently introduced an image decomposition model to split an image into two components: a geometrical component and a texture (oscillatory) component. Inspired by his wo...
Jean-François Aujol, Sung Ha Kang
CAD
2004
Springer
15 years 4 months ago
Curve fitting and fairing using conic splines
We present an efficient geometric algorithm for conic spline curve fitting and fairing through conic arc scaling. Given a set of planar points, we first construct a tangent contin...
Xunnian Yang
129
Voted
ISVD
2007
IEEE
15 years 10 months ago
Computing the 3D Voronoi Diagram Robustly: An Easy Explanation
Many algorithms exist for computing the 3D Voronoi diagram, but in most cases they assume that the input is in general position. Because of the many degeneracies that arise in 3D ...
Hugo Ledoux