Sciweavers

137 search results - page 7 / 28
» A Method for Classification of Convex Polygons
Sort
View
LATIN
1998
Springer
13 years 12 months ago
Short and Smooth Polygonal Paths
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
James Abello, Emden R. Gansner
SIAMNUM
2010
127views more  SIAMNUM 2010»
13 years 2 months ago
The Discrete Duality Finite Volume Method for Convection-diffusion Problems
In this paper we extend the discrete duality finite volume (DDFV) formulation to the steady convection-diffusion equation. The discrete gradients defined in DDFV are used to define...
Yves Coudière, Gianmarco Manzini
SIAMJO
2010
136views more  SIAMJO 2010»
13 years 2 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
ISBI
2002
IEEE
14 years 8 months ago
Classifying convex sets for vessel detection in retinal images
We present a method to detect vessels in images of the retina. Instead of relying on pixel classification, as many detection algorithms do, we propose a more natural representatio...
Joes Staal, Stiliyan Kalitzin, Michael D. Abr&agra...
TKDE
2002
168views more  TKDE 2002»
13 years 7 months ago
CLARANS: A Method for Clustering Objects for Spatial Data Mining
Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. To this end, this paper has three main contrib...
Raymond T. Ng, Jiawei Han