Skip to search formSkip to main contentSkip to account menu

Star polyhedron

Known as: Nonconvex polyhedron, Star polytope, Star polyhedra 
In geometry, a star polyhedron is a polyhedron which has some repetitive quality of nonconvexity giving it a star-like visual quality. There are two… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
This paper describes the polytope $\mathbf{P}_{k;N}$ of $i$-star counts, for all $i\le k$, for graphs on $N$ nodes.  The vertices… 
2017
2017
T he article discusses the problem of fi nding a polyhedron given shape inside another nonconvex polyhedron. This problem is a… 
2016
2016
  • 2016
  • Corpus ID: 660501
Historically, polyhedral maps on surfaces made their first appearance as convex polyhedra. The famous Kepler-Poinsot (star… 
2009
2009
We generalize our optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source… 
2009
2009
Collision detection among complex polyhedron models is an open question because of its algorithmic complexity. To satisfy the… 
2006
2006
SummaryA report on the Convex and Absract Polytopes Workshops held at the Banff International Research Station and The University… 
2006
2006
Historically, polyhedral maps on surfaces made their first appearance as convex polyhedra. The famous Kepler-Poinsot (star… 
2003
2003
This article concerns generating 2.5 D models of nonconvex polyhedral that are a complete representation of this polyhedral… 
2002
2002
The paper presents a new approach to generate aspect graphs for 2 1⁄2D nonconvex polyhedral objects with single concavities. Due… 
1993
1993
Let S be a set of (possibly degenerate) triangles in < 3 whose interiors are disjoint. A triangulation of < 3 with respect to S…