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

Algorithm for splitting planar faces

โœ Scribed by Jiri Kripac

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
437 KB
Volume
19
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for drawing planar graphs
An algorithm for drawing planar graphs
โœ Bor Plestenjak ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 382 KB ๐Ÿ‘ 2 views

A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical s

Face area evaluation algorithm for solid
Face area evaluation algorithm for solids
โœ M.C. Wu; C.L. Bajaj; C.R. Liu ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 715 KB

A scan curve algorithm is presented for evaluating the face area of solids in constructive solid geometry (CSG) representation. The applicable domain is limited to solids bounded by three classes of surfaces: all quadric surfaces, cylindrical surfaces, and surfaces of revolution where the last two h