Sciweavers

2183 search results - page 108 / 437
» Multi-pass geometric algorithms
Sort
View
GD
2008
Springer
13 years 11 months ago
Succinct Greedy Graph Drawing in the Hyperbolic Plane
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
David Eppstein, Michael T. Goodrich
STOC
2012
ACM
251views Algorithms» more  STOC 2012»
12 years 16 days ago
Minimax option pricing meets black-scholes in the limit
Option contracts are a type of financial derivative that allow investors to hedge risk and speculate on the variation of an asset’s future market price. In short, an option has...
Jacob Abernethy, Rafael M. Frongillo, Andre Wibiso...
TITB
2002
172views more  TITB 2002»
13 years 9 months ago
Shape recovery algorithms using level sets in 2-D/3-D medical imagery: a state-of-the-art review
The class of geometric deformable models, also known as level sets, has brought tremendous impact to medical imagery due to its capability of topology preservation and fast shape r...
Jasjit S. Suri, Kecheng Liu, Sameer Singh, Swamy L...
MOBIHOC
2010
ACM
13 years 8 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
JCST
2010
109views more  JCST 2010»
13 years 4 months ago
Feature Preserving Mesh Simplification Using Feature Sensitive Metric
We present a new method for feature preserving mesh simplification based on feature sensitive (FS) metric. Previous quadric error based approach is extended to a high-dimensional F...
Jin Wei, Yu Lou