JPH07262394A - Integrating device for adjacent polygon - Google Patents
Integrating device for adjacent polygonInfo
- Publication number
- JPH07262394A JPH07262394A JP6049492A JP4949294A JPH07262394A JP H07262394 A JPH07262394 A JP H07262394A JP 6049492 A JP6049492 A JP 6049492A JP 4949294 A JP4949294 A JP 4949294A JP H07262394 A JPH07262394 A JP H07262394A
- Authority
- JP
- Japan
- Prior art keywords
- polygon
- polygons
- coordinate
- coordinate point
- integrated
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Processing Or Creating Images (AREA)
Abstract
Description
【０００１】[0001]
【産業上の利用分野】本発明は隣接多角形統合装置に関
し、隣接する複数の多角形を１つの面に統合する装置に
関する。BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an adjoining polygon combining apparatus, and more particularly to an apparatus for adjoining a plurality of adjoining polygons into one surface.
【０００２】[0002]
【従来の技術】従来より、コンピュータマッピングやＣ
ＡＤ（コンピュータ・エイティッド・デザイン）の分野
では隣接する複数の多角形を１つの多角形に統合する必
要を生じる場合がある。例えば、固定資産税管理システ
ムにおいては、一筆と呼ばれる土地登記上の単位で登録
された土地（多角形）が複数隣接している場合、これら
を画地と呼ばれる課税上の単である１つの土地（多角
形）に統合する必要がある。2. Description of the Related Art Conventionally, computer mapping and C
In the field of AD (Computer Aided Design), it may be necessary to combine a plurality of adjacent polygons into one polygon. For example, in a fixed asset tax management system, when multiple land (polygons) registered in the unit of land registration called one stroke are adjacent to each other, one land is a taxable unit called an image land. Need to be integrated into (polygon).
【０００３】従来のシステムでは多角形の統合を行なう
場合、ディスプレイ表示画面上で、互いに隣接する複数
の多角形を統合しようとするとき、統合された多角形の
全ての頂点座標を例えばマウスによりクリックして指定
入力し、この指定された頂点座標点列を統合した多角形
のベクトルデータとして登録している。In the conventional system, when the polygons are integrated, when a plurality of polygons adjacent to each other are to be integrated on the display screen of the display, all vertex coordinates of the integrated polygons are clicked by, for example, a mouse. Then, the designated vertex coordinate point sequence is registered as integrated polygon vector data.
【０００４】[0004]
【発明が解決しようとする課題】従来方法では、統合さ
れた多角形の全ての頂点座標を順に指定入力しなければ
ならないため、指定する座標の数が多くなり、かつ指定
する座標は頂点であるため、正確に指定しなければなら
ず、入力操作に神経を使い手間がかかるという問題があ
った。In the conventional method, since all vertex coordinates of the integrated polygon must be designated and input in order, the number of designated coordinates is large and the designated coordinates are vertices. Therefore, there is a problem that it is necessary to specify it accurately, and it takes time and effort to input operation.
【０００５】本発明は上記の点に鑑みなされたもので、
指定する数が少なく、かつ指定する範囲が大きく、操作
が簡単かつ容易となる隣接多角形統合装置を提供するこ
とを目的とする。The present invention has been made in view of the above points,
It is an object of the present invention to provide an adjoining polygon integration device in which the number to be specified is small and the range to be specified is large, and the operation is simple and easy.
【０００６】[0006]
【課題を解決するための手段】本発明の隣接多角形統合
装置は、図１の原理図に示す如く、複数の多角形を表示
する表示手段Ｍ１と、上記表示手段Ｍ１にて表示された
複数の多角形について、隣接する複数の多角形を指定す
る指定手段Ｍ２と、上記指定手段Ｍ２にて指定された複
数の多角形から一つの統合した多角形の座標点を求める
隣接多角形座標点算出手段Ｍ３とを有する。As shown in the principle diagram of FIG. 1, an adjoining polygon integration apparatus of the present invention includes a display means M1 for displaying a plurality of polygons and a plurality of display means M1 for displaying the polygons. With respect to the polygon, the specifying means M2 for specifying a plurality of adjacent polygons, and the adjacent polygon coordinate point calculation for obtaining the coordinate points of one integrated polygon from the plurality of polygons specified by the specifying means M2. And means M3.
【０００７】また、前記隣接多角形座標点算出手段Ｍ３
が、指定された複数の多角形の予め登録されている頂点
座標点列を抽出する抽出手段Ｍ４と、上記抽出手段Ｍ４
により抽出した頂点座標列のうち、複数の多角形で共有
される座標で内角の和が１８０度の整数倍となる不要座
標点を求める不要座標点算出手段Ｍ５と、上記抽出手段
Ｍ４で求めた頂点座標列から上記不要座標点列を排除し
て統合多角形の座標点を求める座標点算出手段Ｍ６を備
える。Further, the adjacent polygon coordinate point calculating means M3
Is an extraction means M4 for extracting a previously registered vertex coordinate point sequence of a plurality of designated polygons, and the extraction means M4.
The unnecessary coordinate point calculating means M5 for obtaining an unnecessary coordinate point whose sum of internal angles is an integral multiple of 180 degrees in the coordinates shared by a plurality of polygons in the vertex coordinate sequence extracted by Coordinate point calculating means M6 for excluding the unnecessary coordinate point sequence from the vertex coordinate sequence to obtain coordinate points of the integrated polygon is provided.
【０００８】[0008]
【作用】本発明においては、複数の多角形夫々を１点で
指定すれば、複数の多角形の頂点座標から統合多角方形
の外形線座標点列及び不要座標点が求められ、更に外形
線座標点列から不要座標点を排除した統合多角形の頂点
座標点列が得られるため、各多角形の指定範囲が大き
く、各多角形を１点で指定すれば良い。In the present invention, by designating each of a plurality of polygons by one point, the outline polygon coordinate point sequence and the unnecessary coordinate points of the integrated polygon are obtained from the vertex coordinates of the polygons. Since the vertex coordinate point sequence of the integrated polygon is obtained by removing unnecessary coordinate points from the point sequence, the designated range of each polygon is large, and each polygon may be designated by one point.
【０００９】[0009]
【実施例】図２は本発明装置としての図形処理システム
の一実施例のブロック図を示す。同図中、処理装置１１
は例えばワークステーション等のコンピュータであり、
図形処理を実行する。入力装置１２は例えばキーボード
であり、コマンド、数値等を隣接多角形座標点算出手段
Ｍ３に対応する処理装置１１に入力する。表示手段Ｍ１
に対応する表示装置１４は例えばＣＲＴディスプレイで
あり、処理装置１１で作図された図形等を表示する。指
定手段Ｍ２に対応するポインティングデバイス１５は例
えばマウスであり、表示装置１４に表示されるカーソル
の位置を指定し処理装置１１に供給する。出力装置１６
は例えばプリンタであり、処理装置１１で作図された図
形等をプリントアウトする。FIG. 2 is a block diagram of an embodiment of a graphic processing system as an apparatus of the present invention. In the figure, a processing device 11
Is a computer such as a workstation,
Perform graphic processing. The input device 12 is, for example, a keyboard, and inputs commands, numerical values, etc. to the processing device 11 corresponding to the adjacent polygon coordinate point calculation means M3. Display means M1
The display device 14 corresponding to is, for example, a CRT display, and displays the figure and the like drawn by the processing device 11. The pointing device 15 corresponding to the designating means M2 is, for example, a mouse, and designates the position of the cursor displayed on the display device 14 and supplies it to the processing device 11. Output device 16
Is a printer, for example, and prints out graphics and the like drawn by the processing device 11.
【００１０】図３，図４は処理装置１１が実行する隣接
多角形統合処理のフローチャートを示す。図３におい
て、ステップＳ１０で統合しようとする多角形を指定す
る。この指定は表示装置１４に表示された図５に示す如
き多角形Ａ，Ｂ，Ｃを統合しようとするとき、多角形
Ａ，Ｂ，Ｃ夫々の内側の任意の点を例えばポインティン
グデバイス１５でクリックすることにより行なわれる。
次にステップＳ２０で多面体の指定が終了したかどうか
を判別し、終了していなければステップＳ１０，Ｓ２０
を繰り返し、終了した場合はステップＳ３０に進む。3 and 4 are flowcharts of the adjoining polygon integration processing executed by the processing device 11. In FIG. 3, a polygon to be integrated is designated in step S10. When the user designates the polygons A, B, and C displayed on the display device 14 as shown in FIG. 5 and integrates them, an arbitrary point inside each of the polygons A, B, and C is clicked with the pointing device 15, for example. It is done by doing.
Next, in step S20, it is determined whether or not the designation of the polyhedron is completed, and if it is not completed, the steps S10 and S20 are executed.
When the process is repeated, the process proceeds to step S30 when completed.
【００１１】抽出手段Ｍ４に対応するステップＳ３０で
は統合しようとする多角形Ａ，Ｂ，Ｃ夫々の頂点座標点
列を抽出する。なお、各多角形はベクトル方式、つまり
頂点座標点列として予め登録されている。図５の例では
次の頂点座標点列群が得られる。In step S30 corresponding to the extracting means M4, the vertex coordinate point sequence of each of the polygons A, B and C to be integrated is extracted. Each polygon is registered in advance as a vector system, that is, a sequence of vertex coordinate points. In the example of FIG. 5, the following vertex coordinate point sequence group is obtained.
【００１２】Ａ＝｛（１，８），（２，４），（５，
５），（５，８）｝ Ｂ＝｛（５，８），（５，１），（９，１）｝ Ｃ＝｛（２，４），（１，１），（５，１），（５，
５）｝ 次のステップＳ４０では抽出した頂点座標点列群内で共
有する座標（同一座標）を求めると共に、頂点座標点列
群から共有座標を除いた非共有座標点列群を求める。図
５では次の共有座標点列が求められる。A = {(1,8), (2,4), (5,
5), (5,8)} B = {(5,8), (5,1), (9,1)} C = {(2,4), (1,1), (5,1) , (5,
5)} In the next step S40, the shared coordinates (same coordinates) in the extracted vertex coordinate point sequence group are obtained, and the non-shared coordinate point sequence group obtained by removing the shared coordinates from the vertex coordinate point sequence group is obtained. In FIG. 5, the next shared coordinate point sequence is obtained.
【００１３】共有座標＝｛（２，４），（５，１），
（５，５），（５，８）｝ ステップＳ５０では共有座標の有無を判別し、共有座標
が無ければステップＳ１２０に進み、有ればステップＳ
６０に進む。Shared coordinates = {(2,4), (5,1),
(5, 5), (5, 8)} In step S50, the presence / absence of shared coordinates is determined. If there is no shared coordinate, the process proceeds to step S120, and if there is shared coordinate, step S120.
Proceed to 60.
【００１４】ステップＳ６０では各多角形につれて共有
座標を含む線分対を求める。例えば共有座標（５，１）
については多角形Ｂ，Ｃから次の線分対が求められる。In step S60, a line segment pair including shared coordinates is obtained for each polygon. For example, shared coordinates (5,1)
For, the following line segment pair is obtained from polygons B and C.
【００１５】Ｂ＝｛（５，１），（９，１）｝，
｛（５，８），（５，１）｝ Ｃ＝｛（１，１），（５，１）｝，｛（５，１），
（５，５）｝ 次のステップＳ７０で共有点の各線分対の内角の和を求
める。この各線分対の内角は余弦定理及び逆余弦関数
（又は逆正弦関数）を用いて求める。B = {(5,1), (9,1)},
{(5,8), (5,1)} C = {(1,1), (5,1)}, {(5,1),
(5, 5)} In the next step S70, the sum of the interior angles of each line segment pair of common points is obtained. The internal angle of each line segment pair is obtained using the cosine theorem and the inverse cosine function (or the inverse sine function).
【００１６】次にステップＳ８０で上記内角の和が１８
０度の倍数かどうかを判別し、１８０度の倍数の場合に
はステップＳ９０に進み、内角の和が１８０度の倍数と
なった座標点を不要座標点として、ステップＳ４０で抽
出した共有座標点列から排除して必要共有座標点を求め
る。次にステップＳ１００では他に共有座標点が有るか
どうかを判別し、まだ有ればステップＳ６０に進んでス
テップＳ６０〜Ｓ１００の処理を繰り返す。これによ
り、図５の例では、（５，１），（５，５）が不要座標
点とされ、（５，８），（２，４）が必要共有座標点と
なる。他に共有座標がなければステップＳ１１０に進
み、ステップＳ４０で求めた非共有座標点列群とステッ
プＳ９０で求めた必要共有座標点との論理和から統合多
角形座標点列を求める。図５の例では｛（１，１），
（９，１），（１，８），（５，８），（２，４）｝と
なる。上記のステップＳ４０〜Ｓ１１０が不要座標点算
出手段Ｍ５に対応している。次に、図４のステップＳ１
２０では統合多角形座標点列の中から、任意の座標点を
とって開始点とする。この開始点としては例えばＸ座標
が最小の座標点（１，１）を選択することが考えられ
る。但し、以下の説明では開始点を（２，４）に決定し
たものとする。この後、ステップＳ１３０で、図５に示
す多角形Ａ，Ｂ，Ｃを構成する頂点座標点列群の線分の
うち、開始点（２，４）を始点とする線分｛（２，
４），（１，１）｝，｛（２，４），（５，５）｝を求
める。なお、線分｛（１，８），（２，４）｝は点
（２，４）を終点としているため除かれる。次に、ステ
ップＳ１４０でこの線分が複数存在するかどうかを判別
し、単一であればステップＳ１８０に進む。Next, in step S80, the sum of the interior angles is 18
It is determined whether or not it is a multiple of 0 degree. If it is a multiple of 180 degrees, the process proceeds to step S90, and the coordinate point whose sum of internal angles becomes a multiple of 180 degrees is set as an unnecessary coordinate point, and the shared coordinate point extracted in step S40. Exclude from the column to find the required shared coordinate points. Next, in step S100, it is determined whether or not there is another shared coordinate point, and if there is another shared coordinate point, the process proceeds to step S60 and the processes of steps S60 to S100 are repeated. As a result, in the example of FIG. 5, (5,1) and (5,5) are unnecessary coordinate points, and (5,8) and (2,4) are necessary shared coordinate points. If there is no other shared coordinate, the process proceeds to step S110, and the integrated polygon coordinate point sequence is obtained from the logical sum of the non-shared coordinate point sequence group obtained in step S40 and the required shared coordinate point obtained in step S90. In the example of FIG. 5, {(1,1),
(9,1), (1,8), (5,8), (2,4)}. The above steps S40 to S110 correspond to the unnecessary coordinate point calculation means M5. Next, step S1 in FIG.
At 20, an arbitrary coordinate point is taken from the integrated polygon coordinate point sequence and set as the starting point. As the starting point, for example, it is conceivable to select the coordinate point (1, 1) having the smallest X coordinate. However, in the following description, it is assumed that the starting point is set to (2, 4). Then, in step S130, among the line segments of the vertex coordinate point sequence group forming the polygons A, B, and C shown in FIG. 5, the line segment having the start point (2, 4) as the start point {(2,
4), (1, 1)}, {(2, 4), (5, 5)} are obtained. The line segment {(1,8), (2,4)} is excluded because it has the point (2,4) as the end point. Next, in step S140, it is determined whether or not there are a plurality of line segments, and if they are single, the process proceeds to step S180.
【００１７】複数存在する場合はステップＳ１５０に進
み、頂点座標点列群の全線分の中で逆向きの線分が存在
するかどうかを判別する。例えば、上記線分｛（２，
４），（１，１）｝は逆向きの線分が存在しないが、線
分｛（２，４），（５，５）｝は逆向きの線分｛（５，
５），（２，４）｝が多角形Ｃに存在する。逆向きの線
分が存在すれば、ステップＳ１６０で該当する線分
｛（２，４），（５，５）｝を排除してステップＳ１５
０に進む。逆向きの線分が存在しなければステップＳ１
８０に進み、残った線分｛（２，４），（１，１）｝の
終点（１，１）を次の開始とする。この後ステップＳ１
９０で次の開始点がステップＳ１２０で決めた開始点と
一致するかどうかを判別し、一致しなければステップＳ
１３０に進んでステップＳ１３０〜Ｓ１９０の処理を繰
り返す。一致すれば、統合多角形を一周したとして次の
ステップＳ２００に進む。上記のステップＳ１２０〜Ｓ
１９０では統合多角形の頂点及び外形線上の点を算出し
ている。If there are a plurality of lines, the process proceeds to step S150, and it is determined whether or not there is an opposite line segment among all the line segments of the vertex coordinate point group. For example, the line segment {(2,
4), (1, 1)} does not have a reverse line segment, but the line segment {(2, 4), (5, 5)} has a reverse line segment {(5, 5
5), (2, 4)} exists in the polygon C. If there is a line segment in the opposite direction, the corresponding line segment {(2,4), (5,5)} is eliminated in step S160, and step S15 is performed.
Go to 0. If there is no reverse line segment, step S1
Proceeding to 80, the end point (1,1) of the remaining line segment {(2,4), (1,1)} is set as the next start. After this step S1
At 90, it is determined whether or not the next starting point matches the starting point determined at step S120.
The process proceeds to step 130 and the processes of steps S130 to S190 are repeated. If they match, it is determined that the integrated polygon has been rotated once, and the process proceeds to step S200. Steps S120 to S above
In 190, the vertices of the integrated polygon and the points on the outline are calculated.
【００１８】ステップＳ２００ではステップＳ１２０〜
Ｓ１９０で開始点（次の開始点を含む）の座標点列
｛（１，１），（５，１），（９，１），（５，８），
（１，８），（２，４）｝の中に、ステップＳ９０で求
めた不要座標点（５，１），（５，５）が存在するかど
うかを判別し、存在した場合にのみ、ステップＳ２１０
で開始点の座標点列から不要座標点を排除する。この後
ステップＳ２２０で開始点の座標点列を統合多角形頂点
座標点列として登録し、処理を終了する。上記のステッ
プＳ２００〜Ｓ２２０が座標点算出手段Ｍ６に対応して
いる。In step S200, steps S120-
In S190, the coordinate point sequence of the start point (including the next start point) {(1,1), (5,1), (9,1), (5,8),
It is determined whether or not the unnecessary coordinate points (5, 1), (5, 5) obtained in step S90 exist in (1, 8), (2, 4)}, and only when they exist, Step S210
The unnecessary coordinate points are excluded from the coordinate point sequence of the start point with. After that, in step S220, the coordinate point sequence of the start point is registered as an integrated polygon vertex coordinate point sequence, and the process ends. The above steps S200 to S220 correspond to the coordinate point calculating means M6.
【００１９】このように上記実施例では多角形Ａ，Ｂ，
Ｃ夫々の内側の１点を３点指定すれば、この多角形Ａ，
Ｂ，Ｃを統合した多角形が得られ、従来は多角形Ａの頂
点を４点、多角形Ｂの頂点を４点多角形Ｃの頂点を３点
と、合計１１点を指定する必要があったのに対し、指定
する点数が大幅に少なくなり、従来の頂点を指定するの
に対し、本実施例では多角形の内側の任意の点を指定す
れば良く入力操作が容易となり、手間を省くことができ
る。Thus, in the above embodiment, the polygons A, B,
If you specify three points on the inside of each C, the polygon A,
A polygon in which B and C are integrated is obtained, and conventionally, it is necessary to specify 11 points in total, that is, the vertex of polygon A is 4 points, the vertex of polygon B is 4 points, and the vertex of polygon C is 3 points. On the other hand, the number of points to be specified is significantly reduced, and in contrast to the conventional specification of vertices, it is sufficient to specify an arbitrary point inside the polygon in the present embodiment, which facilitates the input operation and saves labor. be able to.
【００２０】上記実施例では内角が全て９０度以下の凸
多角形の統合を例にとって説明したが、９０度以上の内
角を持つ凹多角形の統合についても可能である。In the above embodiment, the integration of convex polygons whose interior angles are all 90 degrees or less has been described as an example, but the integration of concave polygons having interior angles of 90 degrees or more is also possible.
【００２１】[0021]
【発明の効果】上述の如く、本発明の隣接多角形統合装
置によれば、複数の多角形夫々を１点で指定すれば、複
数の多角形の頂点座標から統合多角形の外形線座標点列
及び不要座標点が求められ、更に外形線座標点列から不
要座標点を排除した統合多角形の頂点座標点列が得られ
るため、各多角形の指定範囲が大きく、各多角形を１点
で指定すれば良く、操作が簡単かつ容易となり、実用上
きわめて有用である。As described above, according to the adjoining polygon integration apparatus of the present invention, if each of a plurality of polygons is designated by one point, the outline polygon coordinate points of the integrated polygon are calculated from the vertex coordinates of the plurality of polygons. Since the columns and unnecessary coordinate points are obtained, and the vertex coordinate point sequence of the integrated polygon obtained by eliminating unnecessary coordinate points from the outline line coordinate point sequence is obtained, the specified range of each polygon is large, and each polygon has one point. It can be specified by, and the operation becomes simple and easy, which is extremely useful in practice.
【図１】本発明の原理図である。FIG. 1 is a principle diagram of the present invention.
【図２】本発明装置としての図形処理システムのブロッ
ク図である。FIG. 2 is a block diagram of a graphic processing system as an apparatus of the present invention.
【図３】多角形統合処理のフローチャートである。FIG. 3 is a flowchart of polygon integration processing.
【図４】多角形統合処理のフローチャートである。FIG. 4 is a flowchart of polygon integration processing.
【図５】本発明を説明するための図である。FIG. 5 is a diagram for explaining the present invention.
１１ 処理装置 １２ 入力装置 １４ 表示装置 １５ ポインティングデバイス １６ 出力装置 Ｍ１ 表示手段 Ｍ２ 指定手段 Ｍ３ 隣接多角形座標点算出手段 Ｍ４ 抽出手段 Ｍ５ 不要座標点算出手段 Ｍ６ 座標点算出手段 11 processing device 12 input device 14 display device 15 pointing device 16 output device M1 display means M2 designating means M3 adjacent polygon coordinate point calculating means M4 extracting means M5 unnecessary coordinate point calculating means M6 coordinate point calculating means
Claims (2)
１）と、 上記表示手段（Ｍ１）にて表示された複数の多角形につ
いて、隣接する複数の多角形を指定する指定手段（Ｍ
２）と、 上記指定手段（Ｍ２）にて指定された複数の多角形から
一つの統合した多角形の座標点を求める隣接多角形座標
点算出手段（Ｍ３）とを有することを特徴とする隣接多
角形統合装置。1. Display means (M) for displaying a plurality of polygons.
1) and designation means (M) for designating a plurality of adjacent polygons among the plurality of polygons displayed on the display means (M1).
2) and adjacent polygon coordinate point calculation means (M3) for obtaining coordinate points of one integrated polygon from the plurality of polygons designated by the designation means (M2). Polygon integrated device.
が、指定された複数の多角形の予め登録されている頂点
座標点列を抽出する抽出手段（Ｍ４）と、 上記抽出手段（Ｍ４）により抽出した頂点座標列のう
ち、複数の多角形で共有される座標で内角の和が１８０
度の整数倍となる不要座標点を求める不要座標点算出手
段（Ｍ５）と、 上記抽出手段（Ｍ４）で求めた頂点座標列から上記不要
座標点列を排除して統合多角形の座標点を求める座標点
算出手段（Ｍ６）を備えたことを特徴とする請求項１記
載の隣接多角形統合装置。2. The adjacent polygon coordinate point calculation means (M3)
Is shared by a plurality of polygons among the apex coordinate sequence extracted by the extracting means (M4) and the aforesaid apex coordinate sequence extracted by the extracting means (M4). The sum of interior angles is 180
The unnecessary coordinate point calculating means (M5) for obtaining an unnecessary coordinate point that is an integer multiple of the degree, and the unnecessary coordinate point sequence are excluded from the vertex coordinate sequence obtained by the extracting means (M4) to obtain coordinate points of the integrated polygon. The adjacent polygon integration apparatus according to claim 1, further comprising a coordinate point calculating means (M6) for obtaining.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP04949294A JP3361606B2 (en) | 1994-03-18 | 1994-03-18 | Adjacent polygon integration device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP04949294A JP3361606B2 (en) | 1994-03-18 | 1994-03-18 | Adjacent polygon integration device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPH07262394A true JPH07262394A (en) | 1995-10-13 |
| JP3361606B2 JP3361606B2 (en) | 2003-01-07 |
Family
ID=12832654
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP04949294A Expired - Lifetime JP3361606B2 (en) | 1994-03-18 | 1994-03-18 | Adjacent polygon integration device |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JP3361606B2 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100439577B1 (en) * | 2001-08-25 | 2004-07-12 | 이상욱 | Triangular mesh segmentation apparatus and method based on surface normal |
-
1994
- 1994-03-18 JP JP04949294A patent/JP3361606B2/en not_active Expired - Lifetime
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100439577B1 (en) * | 2001-08-25 | 2004-07-12 | 이상욱 | Triangular mesh segmentation apparatus and method based on surface normal |
Also Published As
| Publication number | Publication date |
|---|---|
| JP3361606B2 (en) | 2003-01-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US4982345A (en) | Interactive computer graphics display system processing method for identifying an operator selected displayed object | |
| JPS62288979A (en) | Computer aided design system | |
| JPH0251786A (en) | Scan converting system | |
| CN112100795A (en) | Method and device for comparing computer aided design drawings | |
| JP2009080573A (en) | Display method | |
| US5491769A (en) | Method and apparatus for variable minification of an image | |
| JPH05250472A (en) | Method and device for preparing fine mask of boundary on image in concerned area so as to separate area from remaining parts of image | |
| JP3599198B2 (en) | Figure editing device | |
| US5982377A (en) | Three-dimensional graphic displaying system and method | |
| JPH07262394A (en) | Integrating device for adjacent polygon | |
| EP0841639A2 (en) | Method and apparatus for automatic gap closing in computer aided drawing | |
| US5621865A (en) | Graphics processing apparatus using grid and a method thereof | |
| JPH0285978A (en) | Method for processing hidden-surface of solid | |
| JP4138018B2 (en) | System for modeling a three-dimensional shape of an object by shading a two-dimensional image of the object and a method for realizing the same by a computer | |
| US9063950B2 (en) | Methods and systems for modifying raster graphics software programs | |
| JP3647075B2 (en) | Image search method and apparatus | |
| JPH06168278A (en) | Facility data retrieving device | |
| JPH0785123A (en) | Method for designating object area of picture processing | |
| JP3089525B2 (en) | CAD system | |
| JPH0594507A (en) | Method and device for extracting graphic in electronic composing device | |
| JPH06231261A (en) | Method for displaying parametric trimming curve by polygonal line approximation and graphic display system | |
| JP2714114B2 (en) | Graphic processing method and graphic system | |
| JPH06202304A (en) | Layout processor | |
| JPH02127786A (en) | Two-dimensional expressing method for three-dimensional object | |
| JPH01134673A (en) | Method and device for displaying data of block chart |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| A01 | Written decision to grant a patent or to grant a registration (utility model) |
Free format text: JAPANESE INTERMEDIATE CODE: A01 Effective date: 20021001 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20071018 Year of fee payment: 5 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20081018 Year of fee payment: 6 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20081018 Year of fee payment: 6 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20091018 Year of fee payment: 7 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20091018 Year of fee payment: 7 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20101018 Year of fee payment: 8 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20101018 Year of fee payment: 8 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20111018 Year of fee payment: 9 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20111018 Year of fee payment: 9 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20121018 Year of fee payment: 10 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20121018 Year of fee payment: 10 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20131018 Year of fee payment: 11 |
|
| EXPY | Cancellation because of completion of term |