7351 search results - page 185 / 1471 » Segmenting Point Sets |
135
click to vote
IMC
2003
ACM
15 years 10 months ago
2003
ACM
Internet topology information is only made available in aggregate form by standard routing protocols. Connectivity information and latency characteristicsmust therefore be inferre...
149
click to vote
SIGGRAPH
2000
ACM
15 years 9 months ago
2000
ACM
Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and ...
104
click to vote
SIAMNUM
2010
14 years 11 months ago
2010
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points for multivariate compact sets by basic tools of numerical linear algebra. The fi...
125
Voted
GD
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We deal with a map-labeling problem, named LOFL (Leftpart Ordered Flexible Labeling), to label a set of points in a plane with polygonal obstacles. The label for each poi...
151
Voted
IROS
2007
IEEE
15 years 11 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...