ON THE MATABILITY OF POLYGONS
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2008/10/01
-
Indian UGC (journal)
-
Refrences20
-
GILL BAREQUET Dept. of Computer Science, The Technion—Israel Institute of Technology, Haifa 32000, Israel
-
AYA STEINER Dept. of Mathematics, The Technion—Israel Institute of Technology, Haifa 32000, Israel
Abstract
Cite
BAREQUET, GILL, and AYA STEINER. “ON THE MATABILITY OF POLYGONS”. International Journal of Computational Geometry &Amp; Applications, vol. 18, no. 05, 2008, pp. 469-06, https://doi.org/10.1142/s0218195908002726.
BAREQUET, G., & STEINER, A. (2008). ON THE MATABILITY OF POLYGONS. International Journal of Computational Geometry &Amp; Applications, 18(05), 469-506. https://doi.org/10.1142/s0218195908002726
BAREQUET G, STEINER A. ON THE MATABILITY OF POLYGONS. International Journal of Computational Geometry & Applications. 2008;18(05):469-506.
You May Also Like
- A local search approximation algorithm for k-means clustering
- On a class of O(n2) problems in computational geometry
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- A New Proof for the Existence of Mutually Unbiased Bases
- The Dense k -Subgraph Problem
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Title | ||||
| Title | ||||
| Title | ||||
| 10.1007/BF01900663 | ||||
| 10.1016/S0734-189X(88)80028-8 |