home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.eiffel
- Path: sparky!uunet!usc!sol.ctr.columbia.edu!ira.uka.de!uni-heidelberg!rz.uni-karlsruhe.de!usenet
- From: wolffram@andor.rz.uni-karlsruhe.de (Jochen WOLFFRAM)
- Subject: X graphic library
- Message-ID: <1992Sep2.082601.17147@rz.uni-karlsruhe.de>
- Sender: usenet@rz.uni-karlsruhe.de (USENET News System)
- Organization: University of Karlsruhe, Germany
- Date: Wed, 2 Sep 1992 08:26:01 GMT
- Lines: 18
-
- For visualizing a search process I'm interested in finding
- a highly efficient implementation of the following problem using
- the Eiffel 2.3 X-graphics library.
- The problem is stated very easily:
- I'm given a matrix of differently colored unit squares.
- The search process iteratively assigns new colors to a small subset
- of the unit squares, and these new colors should be displayed
- immediately.
-
- Representing the unit squares as instances of type SQUARE from the
- graphics library is far too inefficient, because SQUAREs are just
- treated as special polygons.
-
- I would appreciate any suggestions.
-
-
- Jochen Wolffram
- (wolffram@andor.wiwi.uni-karlsruhe.de)
-