## Abstract

Given a set of n points P in the Euclidean plane, we consider the problem of locating a 1-corner polygonal chain X such that min_{p∈P} d(p, X) is maximized. The polygonal chain has the added property that its interior angle is α and it partitions P. In this note we present an algorithm that solves the problem in o(n^{3}) time and space. The previous best running time for this problem was O(n^{3} log^{2} n) time [2].

Original language | English |
---|---|

Pages | 33-36 |

Number of pages | 4 |

State | Published - 2007 |

Event | 19th Annual Canadian Conference on Computational Geometry, CCCG 2007 - Ottawa, ON, Canada Duration: 20 Aug 2007 → 22 Aug 2007 |

### Conference

Conference | 19th Annual Canadian Conference on Computational Geometry, CCCG 2007 |
---|---|

Country/Territory | Canada |

City | Ottawa, ON |

Period | 20/08/07 → 22/08/07 |

## Fingerprint

Dive into the research topics of 'Computing a planar widest empty α-siphon in o(n^{3}) time'. Together they form a unique fingerprint.