553 search results - page 28 / 111 » On Planar Path Transformation |
FOCS
1995
IEEE
14 years 1 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
ISMAR
2006
IEEE
14 years 3 months ago
2006
IEEE
This paper proposes a method to automatically detect and reconstruct planar surfaces for immediate use in AR tasks. Traditional methods for plane detection are typically based on ...
ARSCOM
2002
13 years 9 months ago
2002
Given a non-planar graph G with a subdivision of K5 as a subgraph, we can either transform the K5-subdivision into a K3,3-subdivision if it is possible, or else we obtain a partit...
IH
1998
Springer
14 years 2 months ago
1998
Springer
We describe a steganographic system which embeds secret messages into a video stream. We examine the signal path which typically includes discrete cosine transformation (DCT) based...
ICIP
2004
IEEE
14 years 11 months ago
2004
IEEE
This paper presents a novel algorithm for 2D planar curve recognition based on B-Spline modeling. It combines the advantages of the B-Spline that are continuous curve representati...