Skip Navigation

The Computer Journal 2005 48(2):180-199; doi:10.1093/comjnl/bxh075
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Brimkov, V. E.
Right arrow Articles by Barneva, R. P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oupjournals.org

Analytical Honeycomb Geometry for Raster and Volume Graphics

Valentin E. Brimkov1 * and Reneta P. Barneva2 §

1 Fairmont State University, Fairmont, WV 26554, USA, 2 State University of New York, Fredonia, NY 14063, USA

In this paper we investigate the advantages of using hexagonal grids in raster and volume graphics. In 2D, we present a hexagonal graphical model based on a hexagonal grid. In 3D, we introduce two honeycomb graphical models in which the voxels are hexagonal prisms, and we show that these are the only possible models under certain reasonable conditions. In the framework of the proposed models we design the 2D and 3D analytical honeycomb geometry of linear objects as well as of circles and spheres. We demonstrate certain advantages of the honeycomb models and address algorithmic and complexity issues.

Received 29 March 2004. revised 14 September 2004.

* Email: vbrimkov{at}fairmontstate.edu

§ Email: barneva{at}cs.fredonia.edu


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.