Sciweavers

220 search results - page 14 / 44
» A Pseudo-Metric for Weighted Point Sets
Sort
View
COMPGEOM
2003
ACM
14 years 1 months ago
Euclidean bounded-degree spanning tree ratios
Let τK be the worst-case (supremum) ratio of the weight of the minimum degree-K spanning tree to the weight of the minimum spanning tree, over all finite point sets in the Eu
Timothy M. Chan
ICIP
2005
IEEE
14 years 10 months ago
Multiple active contour models based on the EM algorithm
This paper describes an algorithm for the extraction of multiple regions using multiple active contour models (ACMs). The algorithm organizes edge points into strokes and assigns ...
Margarida Silveira, Jorge S. Marques
CCCG
2009
13 years 9 months ago
Data Structures for Range Aggregation by Categories
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles...
Saladi Rahul, Prosenjit Gupta, K. S. Rajan
IMAMS
2007
151views Mathematics» more  IMAMS 2007»
13 years 10 months ago
Discrete Harmonic Functions from Local Coordinates
Abstract. In this work we focus on approximations of continuous harmonic functions by discrete harmonic functions based on the discrete Laplacian in a triangulation of a point set....
Tom Bobach, Gerald E. Farin, Dianne Hansford, Geor...
JCO
2010
182views more  JCO 2010»
13 years 6 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu