๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Linear-time algorithms for testing the realisability of line drawings of curved objects

โœ Scribed by Martin C. Cooper

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
366 KB
Volume
108
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper shows that the semantic labelling of line drawings of curved objects with piecewise C 3 surfaces is solvable in linear time. This result is robust to changes in the assumptions on object shape. When all vanishing points are known, a different linear-time algorithm exists to solve the labelling problem. Furthermore, in both cases, all legally labelled line drawings of curved objects are shown to be physically realisable.

However, when some but not all of the vanishing points are known, when the drawing is an orthographic projection of a scene containing parallel lines or when we wish to minimise the number of phantom junctions, the labelling problem becomes NP-hard. The introduction of collinearity constraints also renders the labelling problem NP-complete, except in the case when all vanishing points are known.

๐Ÿ“œ SIMILAR VOLUMES

Linear constraints for the interpretatio
Linear constraints for the interpretation of line drawings of curved objects
โœ Martin C. Cooper ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 274 KB

Drawings of curved objects often contain many linear features: straight lines, colinear or coplanar points, parallel lines and vanishing points. These linear features give rise to linear constraints on the 3D position of scene points. The resulting problem can be solved by standard linear programmin

A Simple Linear Time Algorithm for Prope
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
โœ Xin He ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 219 KB

In this paper we introduce a new style of drawing a plane graph G, called proper ลฝ . box rectangular PBR drawing. It is defined to be a drawing of G such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal or a vertical line segment, and each face is dr

A fast algorithm for the computation of
A fast algorithm for the computation of the plasma concentration time curve and confidence limits in linear pharmacokinetics
โœ P.J.A. Lago ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 531 KB

An algorithm is developed for the computation of the plasma concentration time curve for a drug administration regime involving fast injection (bolus) and/or continuous infusion. The effect of the pharmacokinetic model parameter variations on the plasma concentration time curve is analyzed and effic