Sciweavers

150 search results - page 12 / 30
» Traversing a set of points with a minimum number of turns
Sort
View
COMCOM
2004
85views more  COMCOM 2004»
13 years 7 months ago
Optimal PNNI complex node representations for restrictive costs
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...
Ilias Iliadis
WSCG
2003
145views more  WSCG 2003»
13 years 8 months ago
Analysis of Four-Dimensional Cardiac Data Sets Using Skeleton-Based Segmentation
Computer-aided analysis of four-dimensional tomography data has become an important tool in modern cardiology. In order to examine the capability and health of a patient’s cardi...
André Neubauer, Rainer Wegenkittl
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
14 years 2 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
Samidh Chatterjee, Michael Connor, Piyush Kumar
EOR
2010
178views more  EOR 2010»
13 years 7 months ago
Facility location problems in the plane based on reverse nearest neighbor queries
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
Sergio Cabello, José Miguel Díaz-B&a...
COMPGEOM
2000
ACM
13 years 12 months ago
Multivariate regression depth
The regression depth of a hyperplane with respect to a set of n points in Rd is the minimum number of points the hyperplane must pass through in a rotation to vertical. We general...
Marshall W. Bern, David Eppstein