首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种基于加减法求交和顶点类型的凹多边形水平扫描填色算法
引用本文:钱汉臣.一种基于加减法求交和顶点类型的凹多边形水平扫描填色算法[J].苏州大学学报(医学版),1994(3).
作者姓名:钱汉臣
作者单位:苏州大学计算机工程系
摘    要:本文给出了一种只用加、减运算就能求水平线与凹多边形边界交点的方法。并根据顶点类型定义,将凹多边形顶点分成“水平顶点”、“极点”、“拐点”三类,设计了基于三类顶点的边界存贮结构,建立了凹多边形水平扫描填色算法,解决了当交点为顶点时可能产生的“交点对”不配对的问题。

关 键 词:凹多边形  填色  水平顶点  极点  拐点  交点对

A HORIZONTAL SCAN COLOR FILLING ALGORITHM BASED ON FINDING CROSSING WITH ADDITION AND SUBTRACTION AND VERTEX TYPE FOR CONCAVE POLYGONS
Qian Hanchen.A HORIZONTAL SCAN COLOR FILLING ALGORITHM BASED ON FINDING CROSSING WITH ADDITION AND SUBTRACTION AND VERTEX TYPE FOR CONCAVE POLYGONS[J].Journal of Suzhou University(Natural Science),1994(3).
Authors:Qian Hanchen
Abstract:This paper gives an algorithm of crossings between horizontal lines and the boundaries of a concave polygon by means of mere addition and subtraction. According to the definition of vertex, it divides three types of concave vertexcs ; Horizontal Vertex, Maximum Vertex and Turning Vertex, upon which it builds up a storage structure for their boundaries and establishes the concave-horizontal scan-color-lilling algorithm , ihns presenting a method to deal with the problem of a 'crossing pair" with one crossing missing in the case of vertex itself being the crossing.
Keywords:concave polygon  color filling  horizontal vertex  mnximun vertex  turning vertex  crossing pair    
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号