home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!math.fu-berlin.de!fauern!rz.uni-passau.de!kirk.fmi.uni-passau.de!mitterma
- From: mitterma@kirk.fmi.uni-passau.de (Andreas Mittermayr)
- Newsgroups: alt.graphics.pixutils
- Subject: heckbert colorquantization
- Date: 28 Jan 1993 17:30:29 GMT
- Organization: University of Passau, Germany
- Lines: 17
- Distribution: world
- Message-ID: <1k957lINNnq6@tom.rz.uni-passau.de>
- NNTP-Posting-Host: kirk.fmi.uni-passau.de
- Keywords: quantization
-
- hello,
-
- two questions to the heckbert colorquantization:
-
- 1)
- in the algorithm-part to find a cutpoint for a box it sais to find the
- longest RGB-axe and sort it.
- what does longest axe mean : the axe with the longest range of values along it, or
- is the longest axe the axe with the most colors ?
-
- 2)
- what does median cut point mean ?
-
-
- greetings
- Andreas
-
-