distance

 
 
 
 
Select: All | None | Toggle
Preview: Open All | Close All
 
1995
 Hangouet, J. F.Computation of the Hausdorff Distance Between Plane Vector Polylines read more1995
1991
 Beard, KateGeneralization Operations and Supporting Structures read more1991
1990
 Ang, Chuan-HengA new region expansion for quadtrees read more1990
 Forsgren, P. O.An Interobject Distance Measure Based on Medial Axes Retrieved from Discrete Distance Maps read more1990
1989
 Beckers, A. L.A Comment on A Note on `Distance Transformations in Digital Images read more1989
 Bobrow, James E.A Direct Minimization Approach for Obtaining the Distance between Convex Polyhedra read more1989
 Wolfson, E.Computing Minimal Distances on Polyhedral Surfaces read more1989
 Eastman, J. R.Pushbroom Algorithms for Calculating Distances in Raster Grids read more1989
 Gold, ChristopherSpatial Adjacency - A General Approach read more1989
1988
 Hinrichs, KlausPlane-Sweep Solves the-Closest Pair Problem Elegantly read more1988
 Hinrichs, KlausA sweep algorithm for all the nearest-neighbors problems read more1988
 Mason, D. C.Comparison of two dilation algorithms for a linear quadtree read more1988
 Vossepoel, Albert M.A Not on Distance Transformation s in Digital Images read more1988
 Das, P. P.A not on Distance Transformations in Arbitrary Dimensions read more1988
1987
 Asano, TakaoShortest Path Between Two Simple Polygons read more1987
1986
 Wang, Cao A.Finding The Minimum Visible Vertex Distance Between Two Nonintersecting Simple Polygons read more1986
 Kim, Baek S.A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition read more1986
 Vaidya, Pravin M.An optimal algorithm for All-Nearest-Neighbors problem read more1986
 Fortune, StevenA Sweepline Algorithm for Voronoi Diagrams read more1986
1985
 Guibas, L.Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams read more1985
 Bhattacharya, Binay K.On Geometric Algorithms that Use The Furthest-Point Voronoi Diagram read more1985
 Widmayer, P.Distance Problems in Computational Geometry with Fixed Orientations read more1985
 Hoffmann, KurtSorting Jordan Sequences in Linear Time read more1985
 Dobkin, David P.A Linear Algorithm for Determining the Separation of Convex Polyhedra read more1985
 Ching, Y. T.Finding the Diameter of a Set of Lines read more1985
 Asano, TakaoPractical Use of Bucketing Techniques in Computational Geometry read more1985
1984
 Borgefors, GunillaDistance Transformations in Arbitrary Dimensions read more1984
 Chin, FrancisMinimum Vertex Distance Between Separable Convex Polygons read more1984
 erson, RichardParallelism and Greedy Algorithms STAN-CS-84-l003 read more1984
 Atkinson, H.Determination of the 3-D Border by Repeated Elimination of Internal Surfaces read more1984
1983
 Besslich, P. W.A Method for the Generation and Processing of Dyadic Indexed Data read more1983
 Bhattacharya, Binay K.Efficient Algorithms for Computing the Maximum Distance between Two Finite Planar Sets read more1983
 Chin, FrancisOptimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons read more1983
1982
 Wahl, Frederich M.A New Distance Mapping and Its Use for Shape Measurement on Binary Patterns. IBM Research Laboratory read more1982
1981
 Shneier, MichaelPath-Length Distances for Quadtrees read more1981
 Schwartz, Jacob T.Finding the Minimum Distance Between Two Convex Polygons read more1981
1980
 Fischler, M. A.An Iconic Transform for Sketch Completion and Shape Abstraction read more1980
 Danielsson, Per-ErikEuclidean Distance Mapping read more1980
1978
 Rosenfeld, AzrielGeodesics in Digital Pictures read more1978
1976
 Nerlich, GrahamThe Shape of Space read more1976
1975
 Shamos, M.Closest-Point Problems read more1975
1968
 Rosenfeld, AzrielDistance Functions on Digital Pictures read more1968
;
Filter Results By SubTopic
 
 

Feedback | About Memento