Largest triangle inside a terrain

Article Type

Research Article

Publication Title

Theoretical Computer Science

Abstract

In this paper, we present an O(n2) time algorithm to find a largest area triangle contained inside a terrain with n vertices. We also present an O(nlog⁡n) time [Formula presented]-factor approximation algorithm and an [Formula presented] time (1−ε)-factor approximation scheme for the same.

First Page

90

Last Page

99

DOI

10.1016/j.tcs.2020.12.018

Publication Date

2-16-2021

This document is currently not available here.

Share

COinS