Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 3645
Articles: 2'506'133
Articles rated: 2609

26 April 2024
 
  » arxiv » 1301.6667

 Article overview



Extremal antipodal polygons and polytopes
O. Aichholzer ; L.E. Caraballo ; J. M. Díaz-Báñez ; R. Fabila-Monroy ; C. Ochoa ; P. Nigsch ;
Date 28 Jan 2013
AbstractLet $S$ be a set of $2n$ points on a circle such that for each point $p in S$ also its antipodal (mirrored with respect to the circle center) point $p’$ belongs to $S$. A polygon $P$ of size $n$ is called emph{antipodal} if it consists of precisely one point of each antipodal pair $(p,p’)$ of $S$.
We provide a complete characterization of antipodal polygons which maximize (minimize, respectively) the area among all antipodal polygons of $S$. Based on this characterization, a simple linear time algorithm is presented for computing extremal antipodal polygons. Moreover, for the generalization of antipodal polygons to higher dimensions we show that a similar characterization does not exist.
Source arXiv, 1301.6667
Services Forum | Review | PDF | Favorites   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

  Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)






ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2024 - Scimetrica