THÔNG TIN TÀI LIỆU
Thông tin cơ bản
Định dạng | |
---|---|
Số trang | 67 |
Dung lượng | 1,72 MB |
Nội dung
Ngày đăng: 12/08/2014, 11:20
Nguồn tham khảo
Tài liệu tham khảo | Loại | Chi tiết | ||
---|---|---|---|---|
6-22. Assuming that all characters in a text strlng have the same width, develop a text-clip- ping algor~thm that cl~ps a string according to the "all-or-none character-clipping"strategy | Sách, tạp chí |
|
||
6-1 5. Write a routine to identify concave p$ygons by calculating cross products of pairs of edge vectors. Exercises | Khác | |||
6-1 6. Write a routine to split a concave polygon using the vector method | Khác | |||
6-1 7 . Write a routine to split a concave polygon using the rotational method 6-1 8 Adapt the Liang-Barsky line-clipping algorithm to polygon clipping | Khác | |||
6-19. Set up a detaled algorithm for Weiler-Atherton polygon clipping assuming that the clipping w~ndow is a rectangle in standard position | Khác | |||
6-20. Devise an algorithm for Weiler-Atherton polygon clipping, where the clipping win dow can be any specified polygon | Khác | |||
6-21 Write a routine to c l ~ p an ell~pse against a rectangular window | Khác | |||
6-23. Develop a text-clipping algorithm that clips ind~vidual characters assuming that the characters aredefined in a pixel grid of a specified w e | Khác | |||
6-24. Wr~te a routine to implement exterior clipping on any part of a defined picture using any specified window | Khác |
TỪ KHÓA LIÊN QUAN
TÀI LIỆU CÙNG NGƯỜI DÙNG
TÀI LIỆU LIÊN QUAN