Sciweavers

35 search results - page 4 / 7
» An Interpolant Based on Line Segment Voronoi Diagrams
Sort
View
ICIP
2003
IEEE
15 years 6 months ago
K-Voronoi diagrams computing in arbitrary domains
We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation ca...
Rubén Cárdenes, Simon K. Warfield, A...
CGVR
2006
15 years 2 months ago
A Bipolar Model for Region Simplification
In this paper we introduce an algorithm for simplifying a 2D discrete region. This algorithm is based on a bipolar model of regions. Given a discrete region, we cut its Voronoi di...
Yuqing Song, Jie Shen, David Yoon
TMI
2002
146views more  TMI 2002»
15 years 25 days ago
Feature-Guided Shape-Based Image Interpolation
Abstract--A feature-guided image interpolation scheme is presented. It is an effective and improved, shape-based interpolation method used for interpolating image slices in medical...
Tong-Yee Lee, Chao-Hung Lin
ISPD
2000
ACM
139views Hardware» more  ISPD 2000»
15 years 5 months ago
Critical area computation for missing material defects in VLSI circuits
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
Evanthia Papadopoulou
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
15 years 2 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson