Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Conference Paper
%1 conf/iccsa/BajuelosTM04
%A Bajuelos, António Leslie
%A Tomás, Ana Paula
%A Marques, Fábio
%B ICCSA (3)
%D 2004
%E Laganà, Antonio
%E Gavrilova, Marina L.
%E Kumar, Vipin
%E Mun, Youngsong
%E Tan, Chih Jeng Kenneth
%E Gervasi, Osvaldo
%I Springer
%K dblp
%P 127-136
%T Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: Lower and Upper Bounds on the Number of Pieces.
%U http://dblp.uni-trier.de/db/conf/iccsa/iccsa2004-3.html#BajuelosTM04
%V 3045
%@ 3-540-22057-7
@inproceedings{conf/iccsa/BajuelosTM04,
added-at = {2018-11-02T00:00:00.000+0100},
author = {Bajuelos, António Leslie and Tomás, Ana Paula and Marques, Fábio},
biburl = {https://www.bibsonomy.org/bibtex/2dafe959f0d7840685d2671c5c88881b5/dblp},
booktitle = {ICCSA (3)},
crossref = {conf/iccsa/2004-3},
editor = {Laganà, Antonio and Gavrilova, Marina L. and Kumar, Vipin and Mun, Youngsong and Tan, Chih Jeng Kenneth and Gervasi, Osvaldo},
ee = {https://doi.org/10.1007/978-3-540-24767-8_14},
interhash = {7804f491225addaee9f4c763f953ead1},
intrahash = {dafe959f0d7840685d2671c5c88881b5},
isbn = {3-540-22057-7},
keywords = {dblp},
pages = {127-136},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2024-04-09T22:41:09.000+0200},
title = {Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: Lower and Upper Bounds on the Number of Pieces.},
url = {http://dblp.uni-trier.de/db/conf/iccsa/iccsa2004-3.html#BajuelosTM04},
volume = 3045,
year = 2004
}