Sciweavers

1009 search results - page 23 / 202
» On Indexing Line Segments
Sort
View
ISVC
2007
Springer
14 years 1 months ago
SketchSurfaces: Sketch-Line Initialized Deformable Surfaces for Efficient and Controllable Interactive 3D Medical Image Segmenta
We present an intuitive, fast and accurate interactive segmentation method for visualizing and analyzing 3D medical images. Our method combines a general deformable subdivision-sur...
Meisam Aliroteh, Tim McInerney
DAGM
2004
Springer
14 years 1 months ago
Fast Statistically Geometric Reasoning About Uncertain Line Segments in 2D- and 3D-Space
This work addresses the two major drawbacks of current statistical uncertain geometric reasoning approaches. In the first part a framework is presented, that allows to represent u...
Christian Beder
ICC
2008
IEEE
128views Communications» more  ICC 2008»
14 years 2 months ago
Quality-of-Service Routing with Two Concave Constraints
—Routing is a process of finding a network path from a source node to a destination node. A good routing protocol should find the “best path” from a source to a destination...
Ka-Chung Leung, King-Shan Lui, Ka-Cheong Leung, Fr...
ICIP
2007
IEEE
14 years 1 months ago
Compression Optimized Tracing of Digital Curves using Graph Theory
The use of an alphabet of line segments to compose a curve is a possible approach for curve data compression. An existing state-of-the-art method considers a quadtree decompositio...
András Hajdu, Ioannis Pitas
COMPGEOM
2006
ACM
14 years 1 months ago
Iterated snap rounding with bounded drift
Snap Rounding (SR for short) is a method for converting arbitrary-precision arrangements of line segments into a fixed-precision representation. In the previous years two variant...
Eli Packer