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)

Related topics

Related topics

11 relations
Alternation (geometry)Dual polyhedronFace (geometry)Faceting

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
NMPC Strategy for a Quadrotor UAV in a 3D Unknown Environment
This work presents a Nonlinear Model Predictive Control strategy for a quadrotor UAV with obstacle avoidance capability in a 3D… 
2017
2017
An algorithm for determining the optimal variant of a cut gem with maximal mass and specified symmetry deviations
T he article discusses the problem of fi nding a polyhedron given shape inside another nonconvex polyhedron. This problem is a… 
2011
2011
Finding shortest path on land surface
Finding shortest paths is a fundamental operator in spatial databases. Recently, terrain datasets have attracted a lot of… 
2009
2009
An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra
We generalize our optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source… 
2008
2008
An Analytical Approach to Star Identification Reliability
Abstract The problem of real-time, on-board star pattern identification is considered which must precede any spacecraft attitude… 
2007
2007
Âóùöòòð Óö Óññøöý Òò Ööôôô Blockin× Îóðùññ´¾¼¼¾µ¸aeóº ¾¸½½½ß½½¼º
2002
2002
Intersection between convex edge and occluding line
The paper presents a new approach to generate aspect graphs for 2 1⁄2D nonconvex polyhedral objects with single concavities. Due… 
Highly Cited
1999
Highly Cited
1999
A Singular Field Method for the Solution of Maxwell's Equations in Polyhedral Domains
It is well known that in the case of a regular domain the solution of the time-harmonic Maxwell's equations allows a… 
1993
1993
Line Stabbing Bounds in Three Dimensions
Let S be a set of (possibly degenerate) triangles in < 3 whose interiors are disjoint. A triangulation of < 3 with respect to S… 
Highly Cited
1984
Highly Cited
1984
A symbolic method for calculating the integral properties of arbitrary nonconvex polyhedra
A simple and systematic method is described for calculating the integral of a polynomial function over an arbitrary nonconvex… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)