Abstract
A discrete analytical plane DAP is defined as a set of lattice points which satisfy two inequalities. In this paper, we define a discrete combinatorial plane DCP and show relations between DAPs and DCPs such that a DCP is a combinatorial surface of a DAP. From the relations, we derive new combinatorial topological properties of DAPs. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
APA
Kenmochi, Y., & Imiya, A. (2003). Combinatorial topologies for discrete planes. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2886, 144–153. https://doi.org/10.1007/978-3-540-39966-7_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free