Publication

Finding minimum area simple pentagons

Thomas Liebling
1997
Journal Articles

Abstract

Given a set P of n points in the plane, we want to find a simple, not necessarily convex, pentagon Q with vertices in P of minimum area. We present an algorithm for solving this problem in time O(nT(n)) and space O(n) , where T(n) is the number of empty triangles in the set.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.