Segmentation of real algebraic plane curves
classification
🧮 math.AG
cs.SC
keywords
algebraicimplementationplanerealalgorithmarticlecountcritical
read the original abstract
In this article we give an implementation of the standard algorithm to segment a real algebraic plane curve defined implicitly. Our implementation is efficient and simpler than previous. We use global information to count the number of half-branches at a critical point.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.