minimum d-convex partition of a multidimensional polyhedron with holes
Clicks: 198
ID: 133221
2008
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
198 views
26 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #12 of 39 articles by views in integrative medicine research
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
In a normed space Rn over the field of real numbers R, which is an α-space [36, 39], one derives the formula expressing the minimum number of d-convex pieces into which a geometric n-dimensional polyhedron with holes can be partitioned. The problem of partitioning a geometric n-dimensional polyhedron has many theoretical and practical applications in various fields such as computational geometry, image processing, pattern recognition, computer graphics, VLSI engineering, and others [5, 10, 11, 19, 21, 28, 29, 31, 43].
Mathematics Subject Classification: 68U05, 52A30, 57Q05
Abstract Quality Issue:
This abstract appears to be incomplete or contains metadata (75 words).
Try re-searching for a better abstract.
| Reference Key |
b2008computerminimum
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Ion Băţ |
| Journal | integrative medicine research |
| Year | 2008 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.