# Connecting outermost dots with a single line?

**URL:** <https://discourse.processing.org/t/connecting-outermost-dots-with-a-single-line/16395>\
**Category:** Libraries\
**Created:** [December 14, 2019, 12:49pm UTC](https://discourse.processing.org/t/connecting-outermost-dots-with-a-single-line/16395 "2019-12-14T12:49:08Z")\
**Posts on this page:** 1\
**Showing post:** 2

<div class="post-metadata">

**Author:** ![kll](https://yyz2.discourse-cdn.com/flex036/user_avatar/discourse.processing.org/kll/32/964_2.png) [@kll](https://discourse.processing.org/u/kll)\
**Post date:** [December 14, 2019, 12:56pm UTC](https://discourse.processing.org/t/connecting-outermost-dots-with-a-single-line/16395/2 "2019-12-14T12:56:57Z")

</div>

[https://en.wikibooks.org/wiki/Algorithm\_Implementation/Geometry/Convex\_hull/Monotone\_chain](https://en.wikibooks.org/wiki/Algorithm_Implementation/Geometry/Convex_hull/Monotone_chain)  
here i play with it:  
[Andrew's monotone chain algorithm](https://discourse.processing.org/t/andrews-monotone-chain-algorithm/5485/3) ,

better  
[Path around a perimeter](https://discourse.processing.org/t/path-around-a-perimeter/15059/4) ,

---

_[View the full topic](https://discourse.processing.org/t/connecting-outermost-dots-with-a-single-line/16395)._
