On the public citation graph
The upper envelope of voronoi surfaces and its applications
0 signed · 184 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.1994.1038openalex-snapshot
Applications of Parametric Searching in Geometric Optimization
inferredcites →https://doi.org/10.1007/3-540-19488-6_118openalex-snapshot
Arrangements of curves in the plane — topology, combinatorics, and algorithms
inferredcites →https://doi.org/10.1007/3-540-55706-7_28openalex-snapshot
Improvements on geometric pattern matching problems
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02187732openalex-snapshot
The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
inferredcites →https://doi.org/10.1007/bf02187733openalex-snapshot
The upper envelope of piecewise linear functions: Algorithms and applications
inferredcites →https://doi.org/10.1007/bf02187890openalex-snapshot
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
inferredcites →https://doi.org/10.1007/bf02187910openalex-snapshot
Congruence, similarity, and symmetries of geometric objects
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1007/bfb0015744openalex-snapshot
A fast algorithm for polygon containment by translation
inferredcites →https://doi.org/10.1016/0020-0190(83)90042-xopenalex-snapshot
A linear time algorithm for the Hausdorff distance between convex polygons
inferredcites →https://doi.org/10.1016/0020-0190(89)90136-1openalex-snapshot
Finding the upper envelope of n line segments in O(n log n) time
inferredcites →https://doi.org/10.1016/0020-0190(91)90233-8openalex-snapshot
Computing the minimum Hausdorff distance between two point sets on a line under translation
inferredcites →https://doi.org/10.1016/0898-1221(85)90105-1openalex-snapshot
Some dynamic computational geometry problems
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1145/109648.109669openalex-snapshot
Approximate matching of polygonal shapes (extended abstract)
inferredcites →https://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferredcites →https://doi.org/10.1145/142675.142700openalex-snapshot
On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane
inferredcites →https://doi.org/10.1145/323233.323264openalex-snapshot
Voronoi diagrams based on convex distance functions
inferredcites →https://doi.org/10.1145/41958.41991openalex-snapshot
Congruence, similarity, and symmetries of geometric objects
inferredcites →https://doi.org/10.1145/98524.98599openalex-snapshot
Computing the minimum Hausdorff distance for point sets under translation
inferredcites →https://doi.org/10.21236/ada235508openalex-snapshot
An Efficiently Computable Metric for Comparing Polygonal Shapes
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
inferredcites →https://doi.org/10.5555/320176.320190openalex-snapshot
An efficiently computable metric for comparing polygonal shapes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4587655openalex-extracted
Computation of the Minimum One-Sided Hausdorff Distance between Plane Curves Under a Similarity Transformation and Relevant Applications in Roundness Error Evaluation
inferred← citeshttps://doi.org/10.1002/1096-9861(20000703)422:3<415::aid-cne8>3.0.co;2-topenalex-snapshot
Comparative analysis of dendritic architecture of identified neurons using the Hausdorff distance metric
inferred← citeshttps://doi.org/10.1002/cnm.3330openalex-snapshot
A framework for automated and objective modification of tubular structures: Application to the internal carotid artery
inferred← citeshttps://doi.org/10.1007/10704703_12openalex-snapshot
Model-Based Object Recognition from a Complex Binary Imagery Using Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/11424758_85openalex-snapshot
Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle
inferred← citeshttps://doi.org/10.1007/11534273_38openalex-snapshot
Improved Approximation Bounds for Planar Point Pattern Matching
inferred← citeshttps://doi.org/10.1007/11847250_16openalex-snapshot
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching
inferred← citeshttps://doi.org/10.1007/3-540-40053-2_41openalex-snapshot
Shape Similarity Measures, Properties and Constructions
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_23openalex-snapshot
Smallest Color-Spanning Objects
inferred← citeshttps://doi.org/10.1007/3-540-45103-x_87openalex-snapshot
Image Matching Using Distance Transform
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_6openalex-snapshot
Computing Largest Common Point Sets under Approximate Congruence
inferred← citeshttps://doi.org/10.1007/3-540-49126-0_22openalex-snapshot
Measuring Resemblance of Complex Patterns
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_28openalex-snapshot
Improvements on geometric pattern matching problems
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_149openalex-snapshot
Geometric pattern matching in d-dimensional space
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_65openalex-snapshot
Matching convex shapes with respect to the symmetric difference
inferred← citeshttps://doi.org/10.1007/978-1-4471-3702-3_4openalex-snapshot
State of the Art in Shape Matching
inferred← citeshttps://doi.org/10.1007/978-3-030-11509-8_13openalex-snapshot
Localized Query: Color Spanning Variations
inferred← citeshttps://doi.org/10.1007/978-3-030-61792-9_23openalex-snapshot
Farthest Color Voronoi Diagrams: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-85906-0_36openalex-snapshot
An Approximation Algorithm for the k-Connected Location Set Cover Problem with Color-Spanning Constraint
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_22openalex-snapshot
Minimum Color Spanning Circle in Imprecise Setup
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_46openalex-snapshot
On the k-colored Rainbow Sets in Fixed Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-319-29221-2_4openalex-snapshot
Color Spanning Objects: Algorithms and Hardness Results
inferred← citeshttps://doi.org/10.1007/978-3-319-42634-1_35openalex-snapshot
Minimum Width Color Spanning Annulus
inferred← citeshttps://doi.org/10.1007/978-3-319-62389-4_27openalex-snapshot
Randomized Incremental Construction for the Hausdorff Voronoi Diagram Revisited and Extended
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_38openalex-snapshot
On the Hausdorff Voronoi Diagram of Point Clusters in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-540-45080-1_159openalex-snapshot
Modified Chamfer Matching Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_37openalex-snapshot
Farthest-Polygon Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_10openalex-snapshot
On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_5openalex-snapshot
Exact Algorithms for the Bottleneck Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-14553-7_27openalex-snapshot
Computing Minimum Diameter Color-Spanning Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_29openalex-snapshot
Some Variations on Constrained Minimum Enclosing Circle Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_65openalex-snapshot
Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere
inferred← citeshttps://doi.org/10.1007/978-3-642-28076-4_7openalex-snapshot
Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_59openalex-snapshot
Computing the Smallest Color-Spanning Axis-Parallel Square
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_9openalex-snapshot
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_22openalex-snapshot
Stabbing Circles for Sets of Segments in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-7091-6103-6_12openalex-snapshot
Content Based Retrieval of VRML Objects — An Iterative and Interactive Approach
inferred← citeshttps://doi.org/10.1007/bf02716804openalex-snapshot
Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation
inferred← citeshttps://doi.org/10.1007/bfb0009488openalex-snapshot
Computing the maximum overlap of two convex polygons under translations
inferred← citeshttps://doi.org/10.1007/pl00005845openalex-snapshot
Computing the Maximum Overlap of Two Convex Polygons under Translations
inferred← citeshttps://doi.org/10.1007/pl00009210openalex-snapshot
Matching Convex Shapes with Respect to the Symmetric Difference
inferred← citeshttps://doi.org/10.1007/pl00009420openalex-snapshot
Geometric Pattern Matching in d -Dimensional Space
inferred← citeshttps://doi.org/10.1007/pl00009478openalex-snapshot
Geometric Applications of a Randomized Optimization Technique
inferred← citeshttps://doi.org/10.1007/s00453-001-0016-8openalex-snapshot
Geometry Helps in Bottleneck Matching and Related Problems
inferred← citeshttps://doi.org/10.1007/s00453-003-1043-4openalex-snapshot
Combinatorial and Experimental Methods for Approximate Point Pattern Matching
inferred← citeshttps://doi.org/10.1007/s00453-004-1095-0openalex-snapshot
The Hausdorff Voronoi Diagram of Point Clusters in the Plane
inferred← citeshttps://doi.org/10.1007/s00453-007-9059-9openalex-snapshot
Improved Approximation Bounds for Planar Point Pattern Matching
inferred← citeshttps://doi.org/10.1007/s00453-011-9553-yopenalex-snapshot
Exact Algorithms for the Bottleneck Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/s00453-016-0118-yopenalex-snapshot
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters
inferred← citeshttps://doi.org/10.1007/s00453-017-0299-zopenalex-snapshot
Stabbing Circles for Sets of Segments in the Plane
inferred← citeshttps://doi.org/10.1007/s00453-022-00997-xopenalex-snapshot
Small Candidate Set for Translational Pattern Search
inferred← citeshttps://doi.org/10.1007/s00453-025-01311-1openalex-snapshot
The Farthest Color Voronoi Diagram in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-006-1263-xopenalex-snapshot
On the Union of κ-Round Objects in Three and Four Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-006-1272-9openalex-snapshot
A Single Cell in an Arrangement of Convex Polyhedra in ${\Bbb R}^3$
inferred← citeshttps://doi.org/10.1007/s00454-022-00433-5openalex-snapshot
Bipartite Diameter and Other Measures Under Translation
inferred← citeshttps://doi.org/10.1007/s00454-023-00492-2openalex-snapshot
Unbounded Regions of High-Order Voronoi Diagrams of Lines and Line Segments in Higher Dimensions
inferred← citeshttps://doi.org/10.1007/s10589-005-4560-zopenalex-snapshot
Efficient Computation of the Hausdorff Distance Between Polytopes by Exterior Random Covering
inferred← citeshttps://doi.org/10.1007/s10878-012-9452-4openalex-snapshot
Some variations on constrained minimum enclosing circle problem
inferred← citeshttps://doi.org/10.1007/s10878-018-0347-xopenalex-snapshot
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
inferred← citeshttps://doi.org/10.1007/s10898-005-6017-4openalex-snapshot
Hausdorff Matching and Lipschitz Optimization
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00047-xopenalex-snapshot
Geometric pattern matching under Euclidean motion
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50004-8openalex-snapshot
Discrete Geometric Shapes: Matching, Interpolation, and Approximation**Partially supported by Deutsche Forschungsgemeinschaft (DFG), Grant No. A1 253/4-2.
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50006-1openalex-snapshot
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
inferred← citeshttps://doi.org/10.1016/j.adhoc.2013.03.005openalex-snapshot
Best and worst-case coverage problems for arbitrary paths in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2003.07.003openalex-snapshot
The weighted farthest color Voronoi diagram on trees and graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.11.004openalex-snapshot
Farthest-polygon Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.04.005openalex-snapshot
Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.01.005openalex-snapshot
Bottleneck detour tree of points on a path
inferred← citeshttps://doi.org/10.1016/j.dam.2012.01.006openalex-snapshot
The bottleneck 2-connected k -Steiner network problem for k≤2
inferred← citeshttps://doi.org/10.1016/j.dam.2018.02.014openalex-snapshot
Color spanning objects: Algorithms and hardness results
inferred← citeshttps://doi.org/10.1016/j.ifacol.2022.11.246openalex-snapshot
Vector Field-based Collision Avoidance for Moving Obstacles with Time-Varying Elliptical Shape
inferred← citeshttps://doi.org/10.1016/j.ins.2021.05.034openalex-snapshot
On the role of distance transformations in Baddeley’s Delta Metric
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.08.003openalex-snapshot
On the parameterized complexity of d-dimensional point set pattern matching
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.09.003openalex-snapshot
Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.10.003openalex-snapshot
A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.04.021openalex-snapshot
Geometric pattern matching for point sets in the plane under similarity transformations
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.05.014openalex-snapshot
On exact solutions to the Euclidean bottleneck Steiner tree problem
inferred← citeshttps://doi.org/10.1016/j.patcog.2009.05.014openalex-snapshot
Approximate input sensitive algorithms for point pattern matching
inferred← citeshttps://doi.org/10.1016/j.robot.2022.104156openalex-snapshot
A local reactive steering law for 2D collision avoidance with curvature constraints and constant speed
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.022openalex-snapshot
Efficiently approximating color-spanning balls
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.031openalex-snapshot
Minimum width color spanning annulus
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.013openalex-snapshot
Color-spanning localized query
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.07.016openalex-snapshot
Minimum color spanning circle of imprecise points
inferred← citeshttps://doi.org/10.1016/s0031-3203(98)00086-7openalex-snapshot
Efficient algorithms for robust feature matching
inferred← citeshttps://doi.org/10.1016/s0893-6080(96)00075-5openalex-snapshot
HAVNET: A New Neural Network Architecture for Pattern Recognition
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00032-1openalex-snapshot
Getting around a lower bound for the minimum Hausdorff distance
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1017/cbo9780511777684.004openalex-snapshot
Survey of image registration methods
inferred← citeshttps://doi.org/10.1017/cbo9780511777684.009openalex-snapshot
New approaches to robust, point-based image registration
inferred← citeshttps://doi.org/10.1023/a:1008022116857openalex-snapshot
Reliable and Efficient Pattern Matching Using an Affine Invariant Metric
inferred← citeshttps://doi.org/10.1080/13658816.2012.654792openalex-snapshot
An efficient outlying trajectories mining approach based on relative distance
inferred← citeshttps://doi.org/10.1089/cmb.2009.0202openalex-snapshot
Evaluation of the Interaction of Cyclin-Dependent Kinase 5 with Activator p25 and with p25-Derived Inhibitor CIP
inferred← citeshttps://doi.org/10.1090/conm/453/08794openalex-snapshot
State of the union (of geometric objects)
inferred← citeshttps://doi.org/10.1109/34.761267openalex-snapshot
Approximate geometric pattern matching under rigid motions
inferred← citeshttps://doi.org/10.1109/isvd.2011.17openalex-snapshot
The $L_\infty$ Hausdorff Voronoi Diagram Revisited
inferred← citeshttps://doi.org/10.1109/jsee.2013.00042openalex-snapshot
Density-based trajectory outlier detection algorithm
inferred← citeshttps://doi.org/10.1109/mass.2010.5663957openalex-snapshot
Best and worst-case coverage problems for arbitrary paths in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/sma.2001.923389openalex-snapshot
Shape matching: similarity measures and algorithms
inferred← citeshttps://doi.org/10.1109/tcbb.2011.42openalex-snapshot
Superposition and Alignment of Labeled Point Clouds
inferred← citeshttps://doi.org/10.1109/tgrs.2020.3011034openalex-snapshot
Road-Network-Based Fast Geolocalization
inferred← citeshttps://doi.org/10.1115/1.4038968openalex-snapshot
Circle-Point Containment, Monte Carlo Method for Shape Matching Based on Feature Points Using the Technique of Sparse Uniform Grids
inferred← citeshttps://doi.org/10.1115/detc2004-57761openalex-snapshot
Identifying Similar Parts for Assisting Cost Estimation of Prismatic Machined Parts
inferred← citeshttps://doi.org/10.1137/1.9781611975482.180openalex-snapshot
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability
inferred← citeshttps://doi.org/10.1137/s0097539704444245openalex-snapshot
Output-Sensitive Construction of the Union of Triangles
inferred← citeshttps://doi.org/10.1137/s0097539794266602openalex-snapshot
On Translational Motion Planning of a Convex Polyhedron in 3-Space
inferred← citeshttps://doi.org/10.1142/s0218001499000653openalex-snapshot
A ROBUST AFFINE INVARIANT METRIC ON BOUNDARY PATTERNS
inferred← citeshttps://doi.org/10.1142/s0218195901000596openalex-snapshot
POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD
inferred← citeshttps://doi.org/10.1142/s0218195904001536openalex-snapshot
THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH
inferred← citeshttps://doi.org/10.1142/s0218195909003076openalex-snapshot
SMALLEST COLOR-SPANNING OBJECT REVISITED
inferred← citeshttps://doi.org/10.1142/s0218195909003118openalex-snapshot
MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION
inferred← citeshttps://doi.org/10.1142/s0218195915500089openalex-snapshot
The L∞ Hausdorff Voronoi Diagram Revisited
inferred← citeshttps://doi.org/10.1142/s0219467809003459openalex-snapshot
A GPU-BASED ALGORITHM FOR APPROXIMATELY FINDING THE LARGEST COMMON POINT SET IN THE PLANE UNDER SIMILARITY TRANSFORMATION
inferred← citeshttps://doi.org/10.1145/1064092.1064099openalex-snapshot
Almost tight bound for a single cell in an arrangement of convex polyhedra in R 3
inferred← citeshttps://doi.org/10.1145/1531326.1531380openalex-snapshot
Interactive Hausdorff distance computation for general polygonal models
inferred← citeshttps://doi.org/10.1145/1576246.1531380openalex-snapshot
Interactive Hausdorff distance computation for general polygonal models
inferred← citeshttps://doi.org/10.1145/177424.177555openalex-snapshot
Matching shapes with a reference point
inferred← citeshttps://doi.org/10.1145/1824777.1824791openalex-snapshot
Hausdorff distance under translation for points and balls
inferred← citeshttps://doi.org/10.1145/237218.237399openalex-snapshot
Improvements on bottleneck matching and related problems using geometry
inferred← citeshttps://doi.org/10.1145/237218.237420openalex-snapshot
Curve based stereo matching using the minimum Hausdorff distance
inferred← citeshttps://doi.org/10.1145/2462356.2462390openalex-snapshot
Sharp bounds on Davenport-Schinzel sequences of every order
inferred← citeshttps://doi.org/10.1145/2493132.2462390openalex-snapshot
Sharp bounds on Davenport-Schinzel sequences of every order
inferred← citeshttps://doi.org/10.1145/262839.263030openalex-snapshot
A general method for partial point set matching
inferred← citeshttps://doi.org/10.1145/276884.276902openalex-snapshot
Improved algorithms for robust point pattern matching and applications to image registration
inferred← citeshttps://doi.org/10.1145/276884.276915openalex-snapshot
Geometric applications of a randomized optimization technique
inferred← citeshttps://doi.org/10.1145/2794075openalex-snapshot
Sharp Bounds on Davenport-Schinzel Sequences of Every Order
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.1145/3460656openalex-snapshot
Discrete Fréchet Distance under Translation
inferred← citeshttps://doi.org/10.1145/777792.777835openalex-snapshot
Hausdorff distance under translation for points and balls
inferred← citeshttps://doi.org/10.1145/997817.997875openalex-snapshot
On the union of κ-round objects
inferred← citeshttps://doi.org/10.1177/0278364918784660openalex-snapshot
Effective metrics for multi-robot motion-planning
inferred← citeshttps://doi.org/10.15607/rss.2017.xiii.022openalex-snapshot
Effective Metrics for Multi-Robot Motion-Planning
inferred← citeshttps://doi.org/10.1587/transfun.2025dmp0005openalex-snapshot
One-Dimensional Higher-Order Color Voronoi Diagrams
inferred← citeshttps://doi.org/10.1587/transinf.e95.d.731openalex-snapshot
On Linear-Sized Farthest-Color Voronoi Diagrams
inferred← citeshttps://doi.org/10.17169/refubium-13006openalex-snapshot
Visual shape similarity and retrieval of figurative images
inferred← citeshttps://doi.org/10.20382/jocg.v13i2a3openalex-snapshot
Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation
inferred← citeshttps://doi.org/10.22215/etd/2016-11226openalex-snapshot
Discrete Geometric Path Analysis in Computational Geometry
inferred← citeshttps://doi.org/10.24200/sci.2017.4115openalex-snapshot
Effiiently computing the smallest axis-parallel squares spanning all colors
inferred← citeshttps://doi.org/10.2514/1.g004446openalex-snapshot
Collision Avoidance for an Unmanned Aerial Vehicle in the Presence of Static and Moving Obstacles
inferred← citeshttps://doi.org/10.3233/fi-2021-2097openalex-snapshot
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model
inferred← citeshttps://doi.org/10.33540/1571openalex-snapshot
Geometric similarity measures and their applications
inferred← citeshttps://doi.org/10.3390/rs14143373openalex-snapshot
Using of Remote Sensing-Based Auxiliary Variables for Soil Moisture Scaling and Mapping
inferred← citeshttps://doi.org/10.48550/arxiv.0902.1615openalex-snapshot
Perturbation of self-similar sets and some regular configurations and comparison of fractals
inferred← citeshttps://doi.org/10.48550/arxiv.1001.3593openalex-snapshot
Farthest-Polygon Voronoi Diagrams
inferred← citeshttps://doi.org/10.48550/arxiv.1306.5838openalex-snapshot
Randomized incremental construction of the Hausdorff Voronoi diagram of non-crossing clusters
inferred← citeshttps://doi.org/10.48550/arxiv.1701.02229openalex-snapshot
Searching edges in the overlap of two plane graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1705.10300openalex-snapshot
Effective Metrics for Multi-Robot Motion-Planning
inferred← citeshttps://doi.org/10.48550/arxiv.2512.14184openalex-snapshot
Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
inferred← citeshttps://doi.org/10.5353/th_b2980757openalex-snapshot
Volume quantification and visualization for spinal bone cement injection
inferred← citeshttps://doi.org/10.5555/1070432.1070452openalex-snapshot
The interface between computational and combinatorial geometry
inferred← citeshttps://doi.org/10.5555/982792.982852openalex-snapshot
Output-sensitive construction of the union of triangles
inferred← citeshttps://doi.org/10.6028/nist.ir.7552openalex-snapshot
Study of interaction of the cyclin-dependent kinase 5 with its activator, p25 and with the p25-derived inhibitor, CIP
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.