At 8:21 PM +0100 26-01-00, Chris Faherty wrote:
>There are lots of older graphics books that show how to do concave polygon
>fills by counting the edges.. i.e. go raster by raster and determine whether
>you are inside or outside of the polygon by counting how many lines you cross
>from left to right.. or something like that.
The problem with most polygon algorithms is that they require dynamic
allocation of memory during the draw--typically one data structure per scan
line. Currently, the blitter is carefully constructed to preallocate any
(small) buffers it might need, and never allocate dynamically.
The change to allow dynamic allocation and fail gracefully was too much for
the short release cycle for OS 3.5. This is certianly something we're
still looking at, but the biggest complaints we get about the blitter are
about it's performance, and not about it's (lack of) features, so we'll
probably spend more time optimizing the current feature set than adding new
features.
--Bob
--
For information on using the Palm Developer Forums, or to unsubscribe, please see
http://www.palm.com/devzone/mailinglists.html
