2188 search results - page 106 / 438 » Instance-Optimal Geometric Algorithms |
130
click to vote
CCCG
2008
15 years 6 months ago
2008
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
131
click to vote
CCCG
2008
15 years 6 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
123
Voted
GMP
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract. An important surface modeling problem in CAD is to connect two disjoint B-spline patches with the second-order geometric continuity. In this paper we present a study to s...
125
Voted
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
145
Voted
ESA
2003
Springer
15 years 10 months ago
2003
Springer
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...