Sorting Points Along an Algebraic Curve

DOI10.1137/0219065MaRDI QIDQ3495677zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algebraic curveconvex segmentsdecompositiongeometric modelspoint locationsolid modelingsorting

Mathematics Subject Classification ID

Curves in algebraic geometry (14H99) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

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

Cited in

(7)

• A new algorithm for Jordan sorting: Its average-case analysis
• Algorithms for ordering unorganized points along parametrized curves
• Convexity preserving interpolation by algebraic curves and surfaces
• scientific article; zbMATH DE number 3957102 (Why is no real title available?)
• scientific article; zbMATH DE number 4109296 (Why is no real title available?)
• scientific article; zbMATH DE number 1163414 (Why is no real title available?)
• Convex hulls of objects bounded by algebraic curves

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)