Fast zone discrimination

CEUR Workshop Proceedings

Volumn 274, Issue , 2007, Pages 41-54

  Clark, Robin ^a  

^a Research and Embedded Development Department   (United Kingdom)

Author keywords

Algorithm; Available region; Euler; Fast zone discrimination; Java area; Present

Indexed keywords

AVAILABLE REGION; EULER; FAST ZONE DISCRIMINATION; JAVA AREA; PRESENT;

ALGORITHMS; CONCRETES; GRAPHIC METHODS;

VISUAL LANGUAGES;

EID: 84884994124     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. R. Clark. Failure mode modular de-composition using spider diagrams. In Proceedings of Euler Diagrams 2004, Volume 134 of Electronic Notes in Theoretical Computer Science, pages 19-31, 2005. (Pubitemid 40682566)
2. J. Howse, G. Stapleton, and J. Taylor. Spider diagrams. LMS Journal of Computation and Mathematics, 8:145-194, 2005.
3. Sun Micro Systems. Java area operations. Available from http://java.sun.com/j2se/1.3/docs/api/java/awt/geom/Area.html, 2000.
4. David Tall Ian Stewart. The Foundations of Mathematics: ISBN 0-19-853165-6. Oxford University Press, 1977.
5. Gregory J.E. Rawlins. Compared to What? An introduction to the analysis of algorithms ISBN 0-7167-8243-x. Computer Science Press, 1991.
6. Various Open source Project. Gnuplot 4 home page. Available from http://www.gnuplot.info/,2005.
7. A. Balfour D.H. Marwick. Programming in Standard Fortran 77 ISBN 0-435-77486-7. Heinemann Educational Books, 1979.
8. Gem Stapleton Peter Rodgers, John Howse. Properties of euler diagrams. http://www.cmis.bton.ac.uk/research/vmg/papers/,2007.