![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Leonidas Palios 15 Ioannis Fudos , Leonidas Palios, Evaggelia Pitoura : Geometric-Similarity Retrieval in Large Image Bases. ICDE 2002 : 441- 14 Stavros D. Nikolopoulos , Leonidas Palios: On the Recognition of P 4 -Comparability Graphs. WG 2002 : 355-366 13 Ioannis Fudos , Leonidas Palios: An efficient shape-based approach to image retrieval. Pattern Recognition Letters 23 (6): 731-741 (2002) 12 Stavros D. Nikolopoulos , Leonidas Palios: Recognition and Orientation Algorithms for P 4 -Comparability Graphs. ISAAC 2001 : 320-331 11 Ioannis Fudos , Leonidas Palios: An Efficient Shape-Based Approach to Image Retrieval. DGCI 2000 : 505-517 10 Leonidas Palios: A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon. SWAT 2000 : 367-382 9 Bernard Chazelle , Leonidas Palios: Decomposing the Boundary of a Nonconvex Polyhedron. Algorithmica 17 (3): 245-265 (1997) 8 Leonidas Palios: Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments. J. Algorithms 22 (1): 57-92 (1997) 7 Leonidas Palios: Optimal Tetrahedralization of the 3D-region "between" a Convex Polyhedron and a Convex Polygon. Computational Geometry 6 : 263-276 (1996) 6 Leonidas Palios: On the Number of Extrema of a Polyhedron. CCCG 1994 : 320-325 5 Leonidas Palios: Optimal Tetrahedralization of the 3d-Region between a Convex Polyhedron and a Convex Polygon. CCCG 1994 : 350-356 4 Leonidas Palios: Connecting the Maximum Number of Grid Nodes to the Boundary with Non-Intersecting Line Segments. SWAT 1994 : 255-266 3 Bernard Chazelle , Leonidas Palios: Decomposing the Boundary of a Nonconvex Polyhedron. SWAT 1992 : 364-375 2 Bernard Chazelle , Leonidas Palios: Triangulating a Nonconvex Polytope. Discrete & Computational Geometry 5 : 505-526 (1990) 1 Bernard Chazelle , Leonidas Palios: Triangulating a Non-Convex Polytype. Symposium on Computational Geometry 1989 : 393-400 ![]() DiSC'03 © 2003 Association for Computing Machinery |