Sorting Points Along an Algebraic Curve
From MaRDI portal
Publication:3495677
DOI10.1137/0219065zbMATH Open0711.68096OpenAlexW2028788658MaRDI QIDQ3495677FDOQ3495677
Authors: John K. Johnstone, Chanderjit L. Bajaj
Publication date: 1990
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6681
Recommendations
- Algorithms for ordering unorganized points along parametrized curves
- scientific article; zbMATH DE number 3957102
- Finding \(n\) representative points on an algebraic curve
- Ordering points by linear functionals
- Efficient and exact manipulation of algebraic points and curves
- Arrangement computation for planar algebraic curves
- AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES
- An approximate arrangement algorithm for semi-algebraic curves
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Curves in algebraic geometry (14H99)
Cited In (6)
This page was built for publication: Sorting Points Along an Algebraic Curve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495677)