Sciweavers

269 search results - page 16 / 54
» Computing the inverse sort transform in linear time
Sort
View
IPL
2007
104views more  IPL 2007»
13 years 7 months ago
A linear-time algorithm for Euclidean feature transform sets
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the fun...
Wim H. Hesselink
FSTTCS
2009
Springer
14 years 2 months ago
Automata and temporal logic over arbitrary linear time
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
Julien Cristau
SIGGRAPH
1993
ACM
13 years 11 months ago
Frequency domain volume rendering
The Fourier projection-slice theorem allows projections of volume data to be generated in O(n2 log n) time for a volume of size n3 . The method operates by extracting and inverse ...
Takashi Totsuka, Marc Levoy
RT
1999
Springer
13 years 11 months ago
Computing Visibility for Triangulated Panoramas
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
Chi-Wing Fu, Tien-Tsin Wong, Pheng-Ann Heng
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
13 years 11 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan