Wu Anti-aliased Lines
Your average Breshenham line drawing algorithm draws lines quickly, but not that nicely. Your average integer line renderer produces nasty jaggedy lines that can only be drawn between integer coordinates. I saw a nice anti-aliased line drawer in one of Michael Abrash's books, and decided to improve it to handle non-integer coordinates. A wu-line is not only better looking than a normal line, it
Adobe Flash Platform * ワインディングè¦å‰‡ã®å®šç¾©
æ‹¡å¼µã•ã‚ŒãŸæç”» API ã§ã¯ã€ãƒ‘スã®ã€Œãƒ¯ã‚¤ãƒ³ãƒ‡ã‚£ãƒ³ã‚°ã€ã®æ¦‚念も導入ã•ã‚Œã¾ã—ãŸã€‚ã“ã‚Œã¯ã€ãƒ‘スã®æ–¹å‘を表ã—ã¾ã™ã€‚パスã®ãƒ¯ã‚¤ãƒ³ãƒ‡ã‚£ãƒ³ã‚°ã¯ã€æ£ï¼ˆæ™‚計回り）ã¾ãŸã¯è² （å時計回り）ã®ã„ãšã‚Œã‹ã§ã™ã€‚data パラメーターã«å¯¾ã—ã¦ãƒ™ã‚¯ã‚¿ãƒ¼ã§æä¾›ã•ã‚Œã‚‹åº§æ¨™ã‚’レンダラーãŒè§£é‡ˆã™ã‚‹é †åºã«ã‚ˆã‚Šã€ãƒ¯ã‚¤ãƒ³ãƒ‡ã‚£ãƒ³ã‚°ãŒæ±ºã¾ã‚Šã¾ã™ã€‚ ã•ã‚‰ã«ã€ Graphics.drawPath() メソッドã«ã¯ã€Œwindingã€ã¨ã„ã†ç¬¬ 3 ã®ã‚ªãƒ—ションã®ãƒ‘ラメーターãŒã‚ã‚Šã¾ã™ã€‚ drawPath(commands:Vector.<int>, data:Vector.<Number>, winding:String = "evenOdd"):void ã“ã®ã‚³ãƒ³ãƒ†ã‚ストã§ã¯ã€3 番目ã®ãƒ‘ラメーターã¯äº¤å·®ã™ã‚‹ãƒ‘スã®ãƒ¯ã‚¤ãƒ³ãƒ‡ã‚£ãƒ³ã‚°ã¤ã¾ã‚Šå¡—ã‚Šè¦å‰‡ã‚’指定ã™ã‚‹æ–‡å—列ã¾ãŸã¯å®šæ•°ã§ã™ã€‚定数値ã¯ã€GraphicsPathWinding クラス㧠Graph
[ヅ]Javaã§ãƒ‰ãƒ¼ãƒŠãƒ„・ãƒãƒªã‚´ãƒ³(ç©´ã‚ããƒãƒªã‚´ãƒ³)ã‚’æç”»ã™ã‚‹ (2012-01-15)
Java ã§ãƒ‰ãƒ¼ãƒŠãƒ„ãƒãƒªã‚´ãƒ³ (ç©´ã‚ããƒãƒªã‚´ãƒ³, Donut Polygon, Polygon with Holes) ã‚’æç”»ã™ã‚‹ã«ã¯ java.awt.geom.Area クラスを使ãˆã°è§£æ±ºã€‚ ã“ã‚“ãªå›³å½¢ã‚’想定。 ソースコード。 import java.awt.*; import java.awt.geom.*; import java.awt.image.*; import java.io.*; import javax.imageio.*; public class DonutPolygon { public static void main(String[] args) throws Exception { Polygon out1 = new Polygon(new int[]{60,180,240,180,30}, new int[]{60,30,90,240,150}, 5)
Relation:multipolygon - OpenStreetMap Wiki
Relations of type multipolygon are used to represent areas (polygons), typically complex ones with holes inside, or consisting of multiple disjoint parts. They can also be useful to make the distinction between linear objects (e.g. a fence surrounding a property, tagged on the way) and the area inside (tagged on the multipolygon relation) without having to draw overlapping ways. Simple areas are m
A General Polygon Clipping Library
Version 2.32 Alan Murta Advanced Interfaces Group Department of Computer Science University of Manchester Manchester M13 9PL, UK This document describes a C library implementation of a new polygon clipping algorithm. The techniques used are descended from Vatti's polygon clipping method [1]. Subject and clip polygons may be convex or concave, self-intersecting, contain holes, or be comprised of se
ランã‚ング
ランã‚ング
メンテナンス
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
http://objectmix.com/graphics/132987-draw-parallel-polyline-algorithm-needed.html
Murphy's Modified Bresenham Line Algorithm
Amazon.co.jp: Parallel and Distributed Computer Graphics: Fairen, Marta, Pueyo, Xavier: 本
Parallel and Distributed Computer Graphics
http://ja.doukaku.org/23/nested/
Google Code Archive - Long-term storage for Google Code Project Hosting.
windingプãƒãƒ‘ティ - ActionScript 3.0入門ノート CS4
User:Miyabi s/ksj2osm-forest.pl - OpenStreetMap Wiki
Terminology: Polygon or Area?
The Sweet Java Topology Suite – Part II
Esri | There has been a problem
一般財団法人 日本地図センター
sdf2gen 多é‡é€£çµãƒãƒªã‚´ãƒ³ã«å¯¾å¿œ / Yaskey Diary
CADWEBã®é–‹ç™ºæ—¥è¨˜: 数値地図2500ã®å¤šé‡é€£çµãƒãƒªã‚´ãƒ³
GPC General Polygon Clipper library
{{#tags}}- {{label}}
{{/tags}}