Premium
The Development of Programs for the Processing of Parametric Curves
Author(s) -
Koparkar P A,
Mudur S P
Publication year - 1983
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.1983.tb00132.x
Subject(s) - computer science , representation (politics) , intersection (aeronautics) , correctness , euclidean geometry , parametric equation , dijkstra's algorithm , parametric statistics , subdivision , curve fitting , algorithm , theoretical computer science , mathematics , shortest path problem , geometry , graph , statistics , politics , archaeology , history , aerospace engineering , machine learning , political science , law , engineering
This paper presents the development of a suite of programs for the processing of parametrically defined curves in two and three dimensions. The programs are presented in Dijkstra's non‐deterministic guarded command notation. The development of the proof of correctness for the programs is also described. Three typical curve processing tasks, such as drawing, curve path following and intersection detection, are described. The algorithms used in these programs are all based on the “divide and conquer (subdivision)” paradigm. Deviation from linearity and Euclidean bounds are two curve shape properties that are used in many of the curve processing tasks. We present fast methods of computing these properties from the algebraic representation of the curve. In particular the paper considers the cubic and the rational quadratic forms of representation.