Sciweavers

1888 search results - page 198 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
138
Voted
VMV
2007
141views Visualization» more  VMV 2007»
15 years 5 months ago
Distance Calculation between a Point and a Subdivision Surface
This article focuses on algorithms for fast computation of the Euclidean distance between a query point and a subdivision surface. The analyzed algorithms include uniform tessella...
Torsten Ullrich, Volker Settgast, Ulrich Krispel, ...
144
Voted
COMPGEOM
2006
ACM
15 years 10 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir
ESA
2004
Springer
137views Algorithms» more  ESA 2004»
15 years 9 months ago
Fast 3-Coloring Triangle-Free Planar Graphs
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
Lukasz Kowalik
JUCS
2007
122views more  JUCS 2007»
15 years 4 months ago
Efficient Access Methods for Temporal Interval Queries of Video Metadata
: Indexing video content is one of the most important problems in video databases. In this paper we present linear time and space algorithms for handling video metadata that repres...
Spyros Sioutas, Kostas Tsichlas, Bill Vassiliadis,...
112
Voted
ICIP
2009
IEEE
15 years 1 months ago
Computational primitives of visual perception
Great stride has been made in psychological research about primitives of visual perception, which is important to computer vision and image processing. In this paper, we propose a...
Yongzhen Huang, Kaiqi Huang, Tieniu Tan