Research Task
Choose a topic of interest: Convex Hull Algorithms
Keywords:
- Vertices
- Points
- Geometric
- Triangulation
- Mesh
- Algorithm
- Topology
General internet search:
“We can visualize what the convex hull looks like by a thought experiment. Imagine that the points are nails sticking out of the plane, take an elastic rubber band, stretch it around the nails and let it go. It will snap around the nails and assume a shape that minimizes its length. The area enclosed by the rubber band is called the convex hull of P.”
https://brilliant.org/wiki/convex-hull/
Academic search engine; academically recognised source:
“The determination of the convex hull is an example of a primitive operation which is useful for
many analysis methods and has successfully been applied in application domains such as pattern
recognition [4], image processing [28] or stock cutting and allocation [13].”
“The convex hull of a point set in the plane is defined as the smallest convex polygon containing all points.”
Böhm, C. and Kriegel, H.P., 2001. Determining the convex hull in large multidimensional databases. In Data Warehousing and Knowledge Discovery: Third International Conference, DaWaK 2001 Munich, Germany, September 5–7, 2001 Proceedings 3. Springer Berlin Heidelberg.
These were found by using Google Scholar. I like this academic search engine as you can determine what keywords need to show by uing speech marks, and it is easy to navigate and cite from.