On the public citation graph
Efficient piecewise-linear function approximation using the uniform metric
0 signed · 126 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.1002/net.3230140304openalex-snapshot
Euclidean shortest paths in the presence of rectilinear barriers
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-54233-7_172openalex-snapshot
Ray shooting in polygons using geodesic triangulations
inferredcites →https://doi.org/10.1007/3-540-54945-5_59openalex-snapshot
Approximating polygons and subdivisions with minimum link paths
inferredcites →https://doi.org/10.1007/3-540-55210-3_187openalex-snapshot
Linear approximation of simple objects
inferredcites →https://doi.org/10.1007/3-540-55706-7_10openalex-snapshot
Parallel algorithms for all minimum link paths and link center problems
inferredcites →https://doi.org/10.1007/3-540-57568-5_283openalex-snapshot
Plane sweep algorithms for the polygonal approximation problems with applications
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01553882openalex-snapshot
On the geodesic voronoi diagram of point sites in a simple polygon
inferredcites →https://doi.org/10.1007/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf01901194openalex-snapshot
Parallel algorithms for shortest path problems in polygons
inferredcites →https://doi.org/10.1007/bf02187913openalex-snapshot
Computing the link center of a simple polygon
inferredcites →https://doi.org/10.1007/bf02574699openalex-snapshot
Small-dimensional linear programming and convex hulls made easy
inferredcites →https://doi.org/10.1007/bfb0028273openalex-snapshot
Computing minimum length paths of a given homotopy class
inferredcites →https://doi.org/10.1016/0004-3702(88)90054-9openalex-snapshot
An algorithmic approach to some problems in terrain navigation
inferredcites →https://doi.org/10.1016/0020-0190(86)90037-2openalex-snapshot
Linear programming in O(n × 3d) time
inferredcites →https://doi.org/10.1016/0020-0190(91)90064-oopenalex-snapshot
A new data structure for shortest path queries in a simple polygon
inferredcites →https://doi.org/10.1016/0022-0000(89)90041-xopenalex-snapshot
Optimal shortest path queries in a simple polygon
inferredcites →https://doi.org/10.1016/0022-0000(89)90045-7openalex-snapshot
Computing geodesic furthest neighbors in simple polygons
inferredcites →https://doi.org/10.1016/0166-218x(91)90063-3openalex-snapshot
Computing external farthest neighbors for a simple polygon
inferredcites →https://doi.org/10.1016/0196-6774(91)90024-sopenalex-snapshot
Computing the visibility polygon from a convex set and related problems
inferredcites →https://doi.org/10.1016/0262-8856(89)90037-1openalex-snapshot
Computational morphology
inferredcites →https://doi.org/10.1016/0734-189x(86)90127-1openalex-snapshot
A linear time algorithm for minimum link paths inside a simple polygon
inferredcites →https://doi.org/10.1016/0925-7721(95)00006-uopenalex-snapshot
Separation and approximation of polyhedral objects
inferredcites →https://doi.org/10.1016/1049-9652(91)90056-popenalex-snapshot
Fitting polygonal functions to a set of points in the plane
inferredcites →https://doi.org/10.1016/b978-0-444-70467-2.50011-4openalex-snapshot
Polygonal Approximations of a Curve — Formulations and Algorithms
inferredcites →https://doi.org/10.1016/b978-0-444-70467-2.50012-6openalex-snapshot
On Polygonal Chain Approximation
inferredcites →https://doi.org/10.1016/s0734-189x(86)80027-5openalex-snapshot
Computational-geometric methods for polygonal approximations of a curve
inferredcites →https://doi.org/10.1080/01621459.1969.10501038openalex-snapshot
Curve Fitting by Segmented Straight Lines
inferredcites →https://doi.org/10.1093/oso/9780198534419.001.0001openalex-snapshot
Curve and Surface Fitting with Splines
inferredcites →https://doi.org/10.1109/sfcs.1992.267794openalex-snapshot
Computing a shortest k-link path in a polygon
inferredcites →https://doi.org/10.1112/jlms/s1-39.1.568openalex-snapshot
INTERPOLATION AND APPROXIMATION
inferredcites →https://doi.org/10.1137/0212052openalex-snapshot
Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
inferredcites →https://doi.org/10.1137/0213003openalex-snapshot
Linear Time Algorithms for Two- and Three-Variable Linear Programs
inferredcites →https://doi.org/10.1137/0218055openalex-snapshot
An Optimal-Time Algorithm for Slope Selection
inferredcites →https://doi.org/10.1137/0715022openalex-snapshot
Approximation to Data by Splines with Free Knots
inferredcites →https://doi.org/10.1145/129712.129763openalex-snapshot
Ray shooting and parametric search
inferredcites →https://doi.org/10.1145/142675.142678openalex-snapshot
A subexponential bound for linear programming
inferredcites →https://doi.org/10.1145/142675.142702openalex-snapshot
Diameter, width, closest line pair, and parametric searching
inferredcites →https://doi.org/10.1145/160985.161157openalex-snapshot
Dynamic ray shooting and shortest paths via balanced geodesic triangulations
inferredcites →https://doi.org/10.1145/2157.322410openalex-snapshot
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
inferredcites →https://doi.org/10.1145/2422.322418openalex-snapshot
Linear Programming in Linear Time When the Dimension Is Fixed
inferredcites →https://doi.org/10.1145/323233.323271openalex-snapshot
Finding minimal convex nested polygons
inferredcites →https://doi.org/10.1145/41958.41959openalex-snapshot
Computing the link center of a simple polygon
inferredcites →https://doi.org/10.1145/41958.41964openalex-snapshot
Optimal shortest path queries in a simple polygon
inferredcites →https://doi.org/10.1145/73833.73841openalex-snapshot
An efficient algorithm for link-distance problems
inferredcites →https://doi.org/10.1145/7531.7537openalex-snapshot
Slowing down sorting networks to obtain faster sorting algorithms
inferredcites →https://doi.org/10.1145/98524.98537openalex-snapshot
Minimum-link paths among obstacles in the plane
inferredcites →https://doi.org/10.1201/9780203507643.ch7openalex-snapshot
Interpolation and Approximation
inferredcites →https://doi.org/10.2307/2003277openalex-snapshot
Elementary Numerical Analysis: An Algorithmic Approach
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.2307/2008339openalex-snapshot
Methods in Approximation--Techniques for Mathematical Modelling.
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
inferredcites →https://doi.org/10.5860/choice.31-2162openalex-snapshot
Curve and surface fitting with splines
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1097-0037(200008)36:1<1::aid-net1>3.0.co;2-bopenalex-snapshot
The cardinality-constrained shortest path problem in 2-graphs
inferred← citeshttps://doi.org/10.1002/ecjc.20297openalex-snapshot
Recent progress on geometric algorithms for approximating functions: Toward applications to data analysis
inferred← citeshttps://doi.org/10.1006/gmip.1997.0419openalex-snapshot
Space-Efficient Outlines from Image Data via Vertex Minimization and Grid Constraints
inferred← citeshttps://doi.org/10.1006/gmip.1997.0468openalex-snapshot
Approximating Polygonal Curves in Two and Three Dimensions
inferred← citeshttps://doi.org/10.1007/11678816_25openalex-snapshot
Adaptive Sampling of Motion Trajectories for Discrete Task-Based Analysis and Synthesis of Gesture
inferred← citeshttps://doi.org/10.1007/11775096_16openalex-snapshot
Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths
inferred← citeshttps://doi.org/10.1007/3-540-49292-5_24openalex-snapshot
The Continuous—Function Attribute Class in Decision Tree Induction
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_8openalex-snapshot
Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space
inferred← citeshttps://doi.org/10.1007/978-3-319-59605-1_11openalex-snapshot
Fluctuated Fitting Under the $$\ell _1$$-metric
inferred← citeshttps://doi.org/10.1007/978-3-540-24597-1_19openalex-snapshot
Distance-Preserving Approximations of Polygonal Paths
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_9openalex-snapshot
Polyline Fitting of Planar Points Under Min-sum Criteria
inferred← citeshttps://doi.org/10.1007/978-3-540-70504-8_12openalex-snapshot
Smooth Interpolating Histograms with Error Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-540-70517-8_8openalex-snapshot
Analysis of Human Motion, Based on the Reduction of Multidimensional Captured Data – Application to Hand Gesture Compression, Segmentation and Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_26openalex-snapshot
Path Simplification for Metro Map Layout
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_55openalex-snapshot
Weighted Rectilinear Approximation of Points in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_37openalex-snapshot
Fitting a Step Function to a Point Set
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_24openalex-snapshot
Approximating Points by a Piecewise Linear Function: I
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_20openalex-snapshot
Representing a Functional Curve by Curves with Fewer Peaks
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_25openalex-snapshot
A Randomized Algorithm for Weighted Approximation of Points by a Step Function
inferred← citeshttps://doi.org/10.1007/978-3-642-21931-3_11openalex-snapshot
A Heuristic Homotopic Path Simplification Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_1openalex-snapshot
Piecewise-Linear Approximations of Uncertain Functions
inferred← citeshttps://doi.org/10.1007/978-3-7908-1902-1_41openalex-snapshot
On a Linguistic Description of Dependencies in Data
inferred← citeshttps://doi.org/10.1007/978-981-96-0579-8_10openalex-snapshot
Representation with Minimized Max-Error in Optimal Piecewise Linear Approximation of Time Series Data
inferred← citeshttps://doi.org/10.1007/bfb0045070openalex-snapshot
Optimal multiresolution polygonal approximation
inferred← citeshttps://doi.org/10.1007/pl00009500openalex-snapshot
Efficient Algorithms for Approximating Polygonal Chains
inferred← citeshttps://doi.org/10.1007/s00453-003-1046-1openalex-snapshot
New Results on Path Approximation
inferred← citeshttps://doi.org/10.1007/s00453-009-9342-zopenalex-snapshot
Fitting a Step Function to a Point Set
inferred← citeshttps://doi.org/10.1007/s00453-011-9488-3openalex-snapshot
Efficient Observer-Dependent Simplification in Polygonal Domains
inferred← citeshttps://doi.org/10.1007/s00453-012-9658-yopenalex-snapshot
Approximating Points by a Piecewise Linear Function
inferred← citeshttps://doi.org/10.1007/s00454-008-9132-4openalex-snapshot
Streaming Algorithms for Line Simplification
inferred← citeshttps://doi.org/10.1007/s00454-011-9338-8openalex-snapshot
Representing a Functional Curve by Curves with Fewer Peaks
inferred← citeshttps://doi.org/10.1007/s11081-008-9045-3openalex-snapshot
Convex piecewise-linear fitting
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/j.comgeo.2006.05.002openalex-snapshot
Distance-preserving approximations of polygonal paths
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.07.005openalex-snapshot
Fitting a two-joint orthogonal chain to a point set
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.02.002openalex-snapshot
Computing homotopic line simplification
inferred← citeshttps://doi.org/10.1016/j.cor.2014.03.015openalex-snapshot
A flow allocation strategy for routing over multiple flow classes with an application to air cargo terminals
inferred← citeshttps://doi.org/10.1016/j.dam.2023.03.010openalex-snapshot
A unified framework for bivariate clustering and regression problems via mixed-integer linear programming
inferred← citeshttps://doi.org/10.1016/j.gmod.2012.04.006openalex-snapshot
Computing polygonal path simplification under area measures
inferred← citeshttps://doi.org/10.1016/j.jda.2005.06.008openalex-snapshot
Area-preserving approximations of polygonal paths
inferred← citeshttps://doi.org/10.1016/s0167-8655(01)00130-1openalex-snapshot
A new algorithm for fitting a rectilinear x-monotone curve to a set of points in the plane
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00647-1openalex-snapshot
Continuous location of dimensional structures
inferred← citeshttps://doi.org/10.1080/24725854.2023.2299809openalex-snapshot
Efficient continuous piecewise linear regression for linearising univariate non-linear functions
inferred← citeshttps://doi.org/10.1109/ats.2003.1250834openalex-snapshot
Measurement-based modeling with adaptive sampling [telecom network characteristics
inferred← citeshttps://doi.org/10.1109/icassp.2004.1326325openalex-snapshot
Efficient (piecewise) linear minmax approximation of digital signals
inferred← citeshttps://doi.org/10.1109/icde.2015.7113282openalex-snapshot
Piecewise linear approximation of streaming time series data with max-error guarantees
inferred← citeshttps://doi.org/10.1109/iros.2006.281722openalex-snapshot
Imitation Learning System to Assist Human Task Interactively
inferred← citeshttps://doi.org/10.1109/mdm.2008.27openalex-snapshot
Preprocessing Position Data of Mobile Objects
inferred← citeshttps://doi.org/10.1142/s0218195906001951openalex-snapshot
POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA
inferred← citeshttps://doi.org/10.1142/s0218195912500069openalex-snapshot
FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES
inferred← citeshttps://doi.org/10.1145/1142155.1142158openalex-snapshot
Handling inverted temperature dependence in static timing analysis
inferred← citeshttps://doi.org/10.1145/1247069.1247103openalex-snapshot
Streaming algorithms for line simplification
inferred← citeshttps://doi.org/10.1145/1374618.1374670openalex-snapshot
Fast and quality-guaranteed data streaming in resource-constrained sensor networks
inferred← citeshttps://doi.org/10.1145/237218.237400openalex-snapshot
Approximating monotone polygonal curves using the uniform metric
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.1155/2016/9720256openalex-snapshot
Cross-Layer Cooperative Power Control in Heterogeneous Multihop Networks
inferred← citeshttps://doi.org/10.1214/lnms/1215454134openalex-snapshot
Polynomial algorithms for isotonic regression
inferred← citeshttps://doi.org/10.1287/ijoc.2024.0909openalex-snapshot
Constructing Optimal Piecewise Quadratic Approximations for Enhancing Deterministic Global Optimization
inferred← citeshttps://doi.org/10.1287/moor.1090.0406openalex-snapshot
Locating Objects in the Plane Using Global Optimization Techniques
inferred← citeshttps://doi.org/10.22028/d291-25892openalex-snapshot
Top-k aggregation queries in large-scale distributed systems
inferred← citeshttps://doi.org/10.48550/arxiv.1306.3000openalex-snapshot
Cole's Parametric Search Technique Made Practical
inferred← citeshttps://doi.org/10.48550/arxiv.1508.03671openalex-snapshot
Fuzzy Longest Common Subsequence Matching With FCM Using R
inferred← citeshttps://doi.org/10.5445/ksp/1000003355openalex-snapshot
Ein Beitrag zur Ableitung regelbasierter Modelle aus Zeitreihen
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.