𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a convex hull algorithm for polygons and its application to triangulation problems

✍ Scribed by Godfried T. Toussaint; David Avis

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
500 KB
Volume
15
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new algorithm for triangulation from c
A new algorithm for triangulation from cross sections and its application to surface area estimation
✍ Petra Wiederhold; Mario Villafuerte πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 606 KB

## Abstract This article proposes a new heuristic (locally determined) algorithm for the triangulation between point sequences representing cross‐sectional contours of a surface. Such point sequence is required to be the set of vertices of a polygon representing a Jordan curve and approximating the

Domain decomposition for a non-smooth co
Domain decomposition for a non-smooth convex minimization problem and its application to plasticity
✍ Carsten Carstensen πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 120 KB πŸ‘ 2 views

Lions's work on the Schwarz alternating method for convex minimization problems is generalized to a certain non-smooth situation where the non-differentiable part of the functionals is additive and independent with respect to the decomposition. Such functionals arise naturally in plasticity where th

A priori estimate for convex solutions t
A priori estimate for convex solutions to special Lagrangian equations and its application
✍ Jingyi Chen; Yu Yuan; Micah Warren πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 127 KB

## Abstract We derive a priori interior Hessian estimates for special Lagrangian equations when the potential is convex. When the phase is very large, we show that continuous viscosity solutions are smooth in the interior of the domain. Β© 2008 Wiley Periodicals, Inc.