On the public citation graph

On k-Nearest Neighbor Voronoi Diagrams in the Plane

https://doi.org/10.1109/tc.1982.1676031
0 signed · 301 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00288933openalex-snapshot
Quad trees a data structure for retrieval on composite keys
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1109/sfcs.1975.8openalex-snapshot
Closest-point problems
inferredcites →https://doi.org/10.1109/sfcs.1977.6openalex-snapshot
Applications of a planar separator theorem
inferredcites →https://doi.org/10.1109/t-c.1975.224110openalex-snapshot
An Algorithm for Finding Nearest Neighbors
inferredcites →https://doi.org/10.1109/t-c.1975.224297openalex-snapshot
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
inferredcites →https://doi.org/10.1109/tit.1967.1053964openalex-snapshot
Nearest neighbor pattern classification
inferredcites →https://doi.org/10.1137/0205015openalex-snapshot
Multidimensional Searching Problems
inferredcites →https://doi.org/10.1137/0206043openalex-snapshot
Location of a Point in a Planar Subdivision and Its Applications
inferredcites →https://doi.org/10.1137/0210035openalex-snapshot
A New Approach to Planar Point Location
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1145/322217.322219openalex-snapshot
Two-Dimensional Voronoi Diagrams in the L p -Metric
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/362003.362025openalex-snapshot
Some approaches to best-match file searching
inferredcites →https://doi.org/10.1201/9781420035179.ch63openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1214/aoms/1177700079openalex-snapshot
A Nonparametric Estimate of a Multivariate Density Function
inferredcites →https://doi.org/10.14288/1.0051813openalex-snapshot
Dynamic problems in computational geometry
inferredcites →https://doi.org/10.2172/1453938openalex-snapshot
A Survey of Techniques for Fixed Radius Near Neighbor Searching
inferredcites →https://doi.org/10.2307/2315450openalex-snapshot
Packing and Covering.

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.4145496openalex-extracted
Site Geometry as a Descriptor for Catalystsite Geometry as a Descriptor for Catalyst Selectivity in Intermetallicsselectivity in Interme
inferred← citeshttps://doi.org/10.2139/ssrn.4145497openalex-extracted
Site Geometry as a Descriptor for Catalystsite Geometry as a Descriptor for Catalyst Selectivity in Intermetallicsselectivity in Interme
inferred← citeshttps://doi.org/10.1002/bte2.70004openalex-snapshot
CrysToGraph: A Comprehensive Predictive Model for Crystal Material Properties and the Benchmark
inferred← citeshttps://doi.org/10.1002/rsa.21168openalex-snapshot
The impact of heterogeneity and geometry on the proof complexity of random satisfiability
inferred← citeshttps://doi.org/10.1002/wcm.1031openalex-snapshot
Providing and findingk‐road‐coverage efficiently in wireless sensor networks
inferred← citeshttps://doi.org/10.1007/11534273_16openalex-snapshot
Communication-Aware Processor Allocation for Supercomputers
inferred← citeshttps://doi.org/10.1007/11600930_58openalex-snapshot
On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/11821069_30openalex-snapshot
k-Sets of Convex Inclusion Chains of Planar Point Sets
inferred← citeshttps://doi.org/10.1007/11841036_37openalex-snapshot
Region-Restricted Clustering for Geographic Data Mining
inferred← citeshttps://doi.org/10.1007/3-540-12920-0_1openalex-snapshot
Key-problems and key-methods in computational geometry
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_51openalex-snapshot
A new duality result concerning Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/3-540-26536-8_2openalex-snapshot
Fractal Modeling of Complex Subsurface Geological Structures
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_22openalex-snapshot
Higher Order Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/3-540-47789-6_5openalex-snapshot
The Largest Empty Annulus Problem
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_23openalex-snapshot
2-Point Site Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-50335-8_22openalex-snapshot
On separable and rectangular clusterings
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_24openalex-snapshot
k — Nearest — Neighbor Voronoi diagrams for sets of convex polygons, line segments and points
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_11openalex-snapshot
Voronoi diagrams of moving points in the plane
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_57openalex-snapshot
Compact location problems
inferred← citeshttps://doi.org/10.1007/3-540-60618-1_67openalex-snapshot
Complexity and approximability of certain bicriteria location problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-1325-8_5openalex-snapshot
What-If Emergency Response Through Higher Order Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_27openalex-snapshot
Map of Geometric Minimal Cuts with Applications*
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_27-1openalex-snapshot
Map of Geometric Minimal Cuts with Applications
inferred← citeshttps://doi.org/10.1007/978-1-4615-5319-9_3openalex-snapshot
Minimum Convex Partitions of Polygonal Domains
inferred← citeshttps://doi.org/10.1007/978-3-030-11509-8_16openalex-snapshot
On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_26openalex-snapshot
Approximation and Complexity of the Capacitated Geometric Median Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-82481-4_14openalex-snapshot
Nearest Neighbors Counterfactuals
inferred← citeshttps://doi.org/10.1007/978-3-319-03584-0_2openalex-snapshot
Privacy Preserving for Location-Based Services Using Location Transformation
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_3openalex-snapshot
A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-21903-5_9openalex-snapshot
Supervised Learning: Practice and Theory of Classification with the k-NN Rule
inferred← citeshttps://doi.org/10.1007/978-3-319-43715-6_2openalex-snapshot
Massive MIMO for Interference Suppression: Cell-Edge Aware Zero Forcing
inferred← citeshttps://doi.org/10.1007/978-3-319-75172-6_5openalex-snapshot
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases
inferred← citeshttps://doi.org/10.1007/978-3-540-46515-7_26openalex-snapshot
Order-k Voronoi Diagrams, k-Sections, and k-Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-71549-8_5openalex-snapshot
What-if Emergency Management System: A Generalized Voronoi Diagram Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-74788-8_20openalex-snapshot
Geospatial Cluster Tessellation Through the Complete Order-k Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-540-77024-4_56openalex-snapshot
Analysis of Higher Order Voronoi Diagram for Fuzzy Information Coverage
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_57openalex-snapshot
Geodesic Disks and Clustering in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_62openalex-snapshot
Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction
inferred← citeshttps://doi.org/10.1007/978-3-540-85126-4_12openalex-snapshot
Higher Order Voronoi Diagrams and Distance Functions in Art and Visualization
inferred← citeshttps://doi.org/10.1007/978-3-642-02982-0_19openalex-snapshot
Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee
inferred← citeshttps://doi.org/10.1007/978-3-642-16007-3_3openalex-snapshot
On the Triangle-Perimeter Two-Site Voronoi Diagram
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_7openalex-snapshot
An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram
inferred← citeshttps://doi.org/10.1007/978-3-642-25249-5_9openalex-snapshot
Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-31125-3_20openalex-snapshot
GPU-Based Influence Regions Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_6openalex-snapshot
Higher Order City Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_21openalex-snapshot
On Higher Order Voronoi Diagrams of Line Segments
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_18openalex-snapshot
On the Complexity of Higher Order Abstract Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-61340-1_4openalex-snapshot
Computational Geometry and its Application to Computer Graphics
inferred← citeshttps://doi.org/10.1007/978-3-658-37711-3_7openalex-snapshot
Weiterführende Ergebnisse
inferred← citeshttps://doi.org/10.1007/978-981-10-6680-1_7openalex-snapshot
Framework for Geospatial Query Processing by Integrating Cassandra with Hadoop
inferred← citeshttps://doi.org/10.1007/bf00181432openalex-snapshot
Circles through two points that always enclose many points
inferred← citeshttps://doi.org/10.1007/bf01228508openalex-snapshot
A semidynamic construction of higher-order voronoi diagrams and its randomized analysis
inferred← citeshttps://doi.org/10.1007/bf01759056openalex-snapshot
Order-k voronoi diagrams of sites with additive weights in the plane
inferred← citeshttps://doi.org/10.1007/bf01840438openalex-snapshot
Edge-skeletons in arrangements with applications
inferred← citeshttps://doi.org/10.1007/bf02187685openalex-snapshot
Halfspace range search: An algorithmic application ofk-sets
inferred← citeshttps://doi.org/10.1007/bf02187749openalex-snapshot
A linear-time algorithm for computing the voronoi diagram of a convex polygon
inferred← citeshttps://doi.org/10.1007/bf02187788openalex-snapshot
A new duality result concerning voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferred← citeshttps://doi.org/10.1007/bf02574692openalex-snapshot
On levels in arrangements and voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bfb0024021openalex-snapshot
The volume of the union of many spheres and point inclusion problems
inferred← citeshttps://doi.org/10.1007/bfb0030872openalex-snapshot
Compact location problems with budget and communication constraints
inferred← citeshttps://doi.org/10.1007/bfb0036908openalex-snapshot
On the number of equal-sized semispaces of a set of points in the plane
inferred← citeshttps://doi.org/10.1007/s00453-013-9809-9openalex-snapshot
The k-Nearest-Neighbor Voronoi Diagram Revisited
inferred← citeshttps://doi.org/10.1007/s00453-014-9950-0openalex-snapshot
The Higher-Order Voronoi Diagram of Line Segments
inferred← citeshttps://doi.org/10.1007/s00453-018-00536-7openalex-snapshot
An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/s00453-022-01027-6openalex-snapshot
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes
inferred← citeshttps://doi.org/10.1007/s00454-020-00190-3openalex-snapshot
Separation by Convex Pseudo-Circles
inferred← citeshttps://doi.org/10.1007/s00454-021-00281-9openalex-snapshot
The Multi-Cover Persistence of Euclidean Balls
inferred← citeshttps://doi.org/10.1007/s00454-021-00340-1openalex-snapshot
Algebraic k-Sets and Generally Neighborly Embeddings
inferred← citeshttps://doi.org/10.1007/s00779-016-0918-8openalex-snapshot
k-Nearest neighbors tracking in wireless sensor networks with coverage holes
inferred← citeshttps://doi.org/10.1007/s10479-014-1587-5openalex-snapshot
Up- and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/s10898-024-01386-0openalex-snapshot
The edge labeling of higher order Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/s11276-014-0886-8openalex-snapshot
Vector quantization based QoS evaluation in cognitive radio networks
inferred← citeshttps://doi.org/10.1007/s11390-013-1328-2openalex-snapshot
On 2-Site Voronoi Diagrams Under Geometric Distance Functions
inferred← citeshttps://doi.org/10.1007/springerreference_62677openalex-snapshot
Privacy Preserving in Location Based Services
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00041-7openalex-snapshot
A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00088-9openalex-snapshot
A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90041-topenalex-snapshot
Output sensitive and dynamic constructions of higher order voronoi diagrams and levels in arrangements
inferred← citeshttps://doi.org/10.1016/0031-3203(91)90065-dopenalex-snapshot
Computing the k-relative neighborhood graphs in Euclidean plane
inferred← citeshttps://doi.org/10.1016/0097-3165(85)90017-2openalex-snapshot
On the number of line separations of a finite set in the plane
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90124-uopenalex-snapshot
Applications of generalized matrix searching to geometric algorithms
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90111-mopenalex-snapshot
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90115-5openalex-snapshot
Voronoi diagrams over dynamic scenes
inferred← citeshttps://doi.org/10.1016/0167-8655(86)90013-9openalex-snapshot
An algorithm for finding nearest neighbours in (approximately) constant average time
inferred← citeshttps://doi.org/10.1016/0167-8655(93)90047-hopenalex-snapshot
A hashing-oriented nearest neighbor searching scheme
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90004-0openalex-snapshot
Searching and storing similar lists
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90013-8openalex-snapshot
On separable clusterings
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90022-qopenalex-snapshot
Finding k points with minimum diameter and related problems
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90133-3openalex-snapshot
Testing the necklace condition for shortest tours and optimal factors in the plane
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90024-nopenalex-snapshot
On the randomized construction of the Delaunay tree
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00029-xopenalex-snapshot
A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00009-7openalex-snapshot
Algorithms for proximity problems in higher dimensions
inferred← citeshttps://doi.org/10.1016/b978-0-08-045158-9.00002-6openalex-snapshot
Structural Modeling Using Fractals
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50025-0openalex-snapshot
Geometric Algorithms
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.aim.2024.110055openalex-snapshot
Order-2 Delaunay triangulations optimize angles
inferred← citeshttps://doi.org/10.1016/j.automatica.2018.12.028openalex-snapshot
Higher order mobile coverage control with applications to clustering of discrete sets
inferred← citeshttps://doi.org/10.1016/j.cam.2021.113812openalex-snapshot
Polynomial-reproducing spline spaces from fine zonotopal tilings
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.06.004openalex-snapshot
Constructing minimum-interference networks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.07.001openalex-snapshot
Depth of segments and circles through points enclosing many points: a note
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.08.003openalex-snapshot
Region-restricted clustering for geographic data mining
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.09.011openalex-snapshot
Minimum-sum dipolar spanning tree in R3
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.06.002openalex-snapshot
Covering a bichromatic point set with two disjoint monochromatic disks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.04.008openalex-snapshot
On the complexity of higher order abstract Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.06.002openalex-snapshot
Survivable minimum bottleneck networks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.08.004openalex-snapshot
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/j.comgeo.2018.10.007openalex-snapshot
Assigning weights to minimize the covering radius in the plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101976openalex-snapshot
Dynamic data structures for k-nearest neighbor queries
inferred← citeshttps://doi.org/10.1016/j.commatsci.2011.04.021openalex-snapshot
Microstructure generation of severely deformed materials using Voronoi diagram in Laguerre geometry: Full algorithm
inferred← citeshttps://doi.org/10.1016/j.compenvurbsys.2009.01.002openalex-snapshot
A generic triangle-based data structure of the complete set of higher order Voronoi diagrams for emergency management
inferred← citeshttps://doi.org/10.1016/j.cor.2005.03.034openalex-snapshot
Euclidean push–pull partial covering problems
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.002openalex-snapshot
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112541openalex-snapshot
On circles enclosing many points
inferred← citeshttps://doi.org/10.1016/j.future.2018.10.025openalex-snapshot
Multidimensional privacy preservation in location-based services
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.01.001openalex-snapshot
Higher-order Voronoi diagrams on triangulated surfaces
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.03.016openalex-snapshot
2-Covered paths by a set of antennas with minimum power transmission range
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.07.023openalex-snapshot
Order-k α-hulls and α-shapes
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.01.004openalex-snapshot
Minimum-width annulus with outliers: Circular, square, and rectangular cases
inferred← citeshttps://doi.org/10.1016/j.is.2015.02.001openalex-snapshot
Near neighbor searching with K nearest references
inferred← citeshttps://doi.org/10.1016/j.is.2021.101933openalex-snapshot
Ripple: An approach to locate k nearest neighbours for location-based services
inferred← citeshttps://doi.org/10.1016/j.jcat.2024.115795openalex-snapshot
Enumeration of surface site nuclearity and shape in a database of intermetallic low-index surface facets
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.03.002openalex-snapshot
Bivariate B-splines from convex configurations
inferred← citeshttps://doi.org/10.1016/j.jocs.2017.10.019openalex-snapshot
Review of data structures for computationally efficient nearest-neighbour entropy estimators for large systems with periodic boundary conditions
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.08.006openalex-snapshot
A power-aware 2-covered path routing for wireless body area networks with variable transmission ranges
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2018.12.001openalex-snapshot
Computational geometry and the U.S. Supreme Court
inferred← citeshttps://doi.org/10.1016/j.physa.2014.01.019openalex-snapshot
Detecting spatial homogeneity in the World Trade Web with Detrended Fluctuation Analysis
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.11.015openalex-snapshot
Computing closest and farthest points for a query segment
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80040-6openalex-snapshot
Geometric retrieval problems
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80030-4openalex-snapshot
New upper bounds for neighbor searching
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00107-6openalex-snapshot
Structural tolerance and Delaunay triangulation
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00320-1openalex-snapshot
2-Point site Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/s0198-9715(00)00007-7openalex-snapshot
Data structures and algorithms to support interactive spatial analysis using dynamic Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00304-0openalex-snapshot
Compact location problems
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00027-xopenalex-snapshot
Higher order Delaunay triangulations
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)59974-7openalex-snapshot
Locus Techniques for Shortest Path Problems in Robotics
inferred← citeshttps://doi.org/10.1080/00029890.2004.11920117openalex-snapshot
The Number of Halving Circles
inferred← citeshttps://doi.org/10.1080/02693799408901986openalex-snapshot
Nearest neighbourhood operations with generalized Voronoi diagrams: a review
inferred← citeshttps://doi.org/10.1080/08839510903078176openalex-snapshot
AN ORDER-kVORONOI APPROACH TO GEOSPATIAL CONCEPT MANAGEMENT WITHIN CONCEPTUAL SPACES
inferred← citeshttps://doi.org/10.1090/s0002-9947-07-03976-1openalex-snapshot
Delaunay configurations and multivariate splines: A generalization of a result of B. N. Delaunay
inferred← citeshttps://doi.org/10.1090/tran/2007-359-07openalex-snapshot
inferred← citeshttps://doi.org/10.1093/comjnl/bxr076openalex-snapshot
Minimizing the Range for k-Covered Paths on Sensor Networks
inferred← citeshttps://doi.org/10.1109/12.123385openalex-snapshot
A systolic algorithm for the k-nearest neighbors problem
inferred← citeshttps://doi.org/10.1109/29.1575openalex-snapshot
On the use of a metric-space search algorithm (AESA) for fast DTW-based recognition of isolated words
inferred← citeshttps://doi.org/10.1109/43.752929openalex-snapshot
Critical area computation via Voronoi diagrams
inferred← citeshttps://doi.org/10.1109/acc.2015.7170938openalex-snapshot
Higher order Voronoi based mobile coverage control
inferred← citeshttps://doi.org/10.1109/ccwc.2019.8666451openalex-snapshot
A Parallel Algorithm to Calculate an Approximation to the Order-K Voronoi Diagram using Java Streams and Thrust
inferred← citeshttps://doi.org/10.1109/cicn.2015.225openalex-snapshot
Secure Query Processing Using Open Source GMAP of API
inferred← citeshttps://doi.org/10.1109/cmc.2010.251openalex-snapshot
Minimum Sensor Relocation for k-Coverage in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/glocom.2016.7841585openalex-snapshot
An Effective Antenna Allocation for CoMP Transmission in Dense Small Cell Networks
inferred← citeshttps://doi.org/10.1109/glocom.2017.8254158openalex-snapshot
Intelligent User-Centric Handover Scheme in Ultra-Dense Cellular Networks
inferred← citeshttps://doi.org/10.1109/iccnc.2017.7876096openalex-snapshot
Ensuring k-coverage in Low-Power Wide Area Networks for Internet of Things
inferred← citeshttps://doi.org/10.1109/icdcs.2012.34openalex-snapshot
LAACAD: Load Balancing k-Area Coverage through Autonomous Deployment in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/icis.2007.106openalex-snapshot
Higher Order Voronoi Diagrams for Concept Boundaries and Tessellations
inferred← citeshttps://doi.org/10.1109/icis.2008.91openalex-snapshot
Execution Time Analysis of a Parallel Steiner Tree Algorithm on Server-Client Model of Computation
inferred← citeshttps://doi.org/10.1109/icoict.2017.8074684openalex-snapshot
Indexing Voronoi cells using quadtree in spatial database
inferred← citeshttps://doi.org/10.1109/icpr.1998.711125openalex-snapshot
Reference set thinning for the k-nearest neighbor decision rule
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062001openalex-snapshot
Obstacle Discovery in Distributed Active Sensor Networks
inferred← citeshttps://doi.org/10.1109/infcom.2011.5935008openalex-snapshot
Robust coverage under uncertainty in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/infcom.2011.5935119openalex-snapshot
Optimal relay location and power allocation for low SNR broadcast relay channels
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195558openalex-snapshot
Geometric algorithms for target localization and tracking under location uncertainties in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195629openalex-snapshot
Efficient algorithms for K-anonymous location privacy in participatory sensing
inferred← citeshttps://doi.org/10.1109/is3c.2014.133openalex-snapshot
K Nearest Neighbors Queries in Multi-channel Broadcast Environments
inferred← citeshttps://doi.org/10.1109/istcs.1993.253484openalex-snapshot
Subpixel image registration using circular fiducials
inferred← citeshttps://doi.org/10.1109/isvd.2006.36openalex-snapshot
Using Line and Texture to Visualize Higher-Order Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/isvd.2007.28openalex-snapshot
High Order Voronoi Sculpture
inferred← citeshttps://doi.org/10.1109/isvd.2009.12openalex-snapshot
On the Triangle-Perimeter Two-Site Voronoi Diagram
inferred← citeshttps://doi.org/10.1109/isvd.2010.18openalex-snapshot
On 2-Site Voronoi Diagrams under Arithmetic Combinations of Point-to-Point Distances
inferred← citeshttps://doi.org/10.1109/isvd.2010.29openalex-snapshot
Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks
inferred← citeshttps://doi.org/10.1109/isvd.2011.13openalex-snapshot
On 2-Site Voronoi Diagrams under Geometric Distance Functions
inferred← citeshttps://doi.org/10.1109/isvd.2012.27openalex-snapshot
The L_infinity (L_1) Farthest Line-Segment Voronoi Diagram
inferred← citeshttps://doi.org/10.1109/isvd.2013.17openalex-snapshot
A Sweepline Algorithm for Higher Order Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/iwqos.2011.5931351openalex-snapshot
Evaluating coverage quality through best covered pathes in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/jsyst.2014.2354235openalex-snapshot
Enhanced Location Privacy Preserving Scheme in Location-Based Services
inferred← citeshttps://doi.org/10.1109/mcom.2016.7588224openalex-snapshot
Green alarm systems driven by emergencies in industrial wireless sensor networks
inferred← citeshttps://doi.org/10.1109/mobhoc.2009.5337023openalex-snapshot
A kNN search protocol using a Voronoi diagram in wireless broadcast environments
inferred← citeshttps://doi.org/10.1109/ntms.2011.5720646openalex-snapshot
Optimizing Position Updates for kNN - Is It Worth It?
inferred← citeshttps://doi.org/10.1109/p2p.2011.6038734openalex-snapshot
Efficient stereo segment scheduling in peer-to-peer 3D/multi-view video streaming
inferred← citeshttps://doi.org/10.1109/percom.2009.4912843openalex-snapshot
Optimal k-support coverage paths in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/radar.2006.1631878openalex-snapshot
Surveillance Area As a Multiplicatively Weighted Voronoi Diagram
inferred← citeshttps://doi.org/10.1109/robot.1992.220116openalex-snapshot
Motion planning for spider robots
inferred← citeshttps://doi.org/10.1109/sege65970.2025.11203477openalex-snapshot
Improving Spatial Allocation for Energy System Coupling with Clustering-Based Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/sfcs.1983.17openalex-snapshot
Filtering search: A new approach to query-answering
inferred← citeshttps://doi.org/10.1109/sfcs.1983.22openalex-snapshot
Geometric retrieval problems
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185368openalex-snapshot
Randomized multidimensional search trees: lazy balancing and dynamic shuffling
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185371openalex-snapshot
Randomized multidimensional search trees: further results in dynamic sampling
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743509openalex-snapshot
Random sampling, halfspace range reporting, and construction of (≤k)-levels in three dimensions
inferred← citeshttps://doi.org/10.1109/sibgra.1999.805592openalex-snapshot
An optimal algorithm to construct all Voronoi diagrams for k nearest neighbor search in T/sup 2/
inferred← citeshttps://doi.org/10.1109/smc.2013.312openalex-snapshot
Construction of an Interactive System Aims to Extract Expert Knowledge about the Condition Cultured Corneal Endothelial Cells
inferred← citeshttps://doi.org/10.1109/snpd-sawn.2006.7openalex-snapshot
A Parallel Local Search Algorithm for Euclidean Steiner Tree Problem
inferred← citeshttps://doi.org/10.1109/taes.2016.150642openalex-snapshot
Star identification based on euclidean distance transform, voronoi tessellation, and k-nearest neighbor classification
inferred← citeshttps://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferred← citeshttps://doi.org/10.1109/tc.1987.5009474openalex-snapshot
An Improved Algorithm for Constructing kth-Order Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/tcad.2010.2100550openalex-snapshot
Net-Aware Critical Area Extraction for Opens in VLSI Circuits Via Higher-Order Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/tcomm.2015.2495355openalex-snapshot
Cooperative Base Station Coloring for Pair-Wise Multi-Cell Coordination
inferred← citeshttps://doi.org/10.1109/tcomm.2018.2876424openalex-snapshot
Caching at Base Stations With Heterogeneous User Demands and Spatial Locality
inferred← citeshttps://doi.org/10.1109/tit.2023.3334032openalex-snapshot
Multiple Packing: Lower Bounds via Error Exponents
inferred← citeshttps://doi.org/10.1109/tkde.2014.2302434openalex-snapshot
Secure kNN Query Processing in Untrusted Cloud Environments
inferred← citeshttps://doi.org/10.1109/tpami.2025.3566593openalex-snapshot
General 3D Vision-Language Model With Fast Rendering and Pre-Training Vision-Language Alignment
inferred← citeshttps://doi.org/10.1109/tpds.2012.329openalex-snapshot
Finding Best and Worst k-Coverage Paths in Multihop Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tpds.2013.34openalex-snapshot
Exploiting Service Similarity for Privacy in Location-Based Search Queries
showing the first 200 of 282 · page through all 282
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.