Computational geometry: an introduction
Computational geometry: an introduction
Comparison of three curve intersection algorithms
Computer-Aided Design
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Adaptive forward differencing for rendering curves and surfaces
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Geometric continuity, shape parameters, and geometric constructions for Catmull-Rom splines
ACM Transactions on Graphics (TOG)
Planar maps: an interaction paradigm for graphic design
CHI '89 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Recipes for geometry and numerical analysis - Part I: an empirical study
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Towards implementing robust geometric computations
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Extension of the Notion of Map and Subdivisions of a Three-Dimensional Space
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
An OBJ3 functional specification for boundary representation
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Error-free boundary evaluation using lazy rational arithmetic: a detailed implementation
SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
Interactive pen-and-ink illustration
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
TicTacToon: a paperless system for professional 2D animation
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Rendering parametric surfaces in pen and ink
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
SnakeToonz: a semi-automatic approach to creating cel animation from video
NPAR '02 Proceedings of the 2nd international symposium on Non-photorealistic animation and rendering
Enhanced Illustration Using Magic Lens Filters
IEEE Computer Graphics and Applications
A Graph Labelling Approach for Connected Feature Selection
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Thinning Grayscale Well-Composed Images: A New Approach for Topological Coherent Image Segmentation
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Computer-Assisted Auto Coloring by Region Matching
PG '03 Proceedings of the 11th Pacific Conference on Computer Graphics and Applications
Dynamic planar map illustration
ACM SIGGRAPH 2007 papers
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
Theoretical Computer Science
Robot Navigation in Multi-terrain Outdoor Environments
International Journal of Robotics Research
Particle-based forecast mechanism for continuous collision detection in deformable environments
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Geometrical, topological, and hierarchical structuring of overlapping 2-D discrete objects
Computers and Graphics
Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Non-Photorealistic Animation and Rendering
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
CrossShade: shading concept sketches using cross-section curves
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
| Hi-index | 0.00 |
A planar map is a figure formed by a set of intersecting lines and curves. Such an object captures both the geometrical and the topological information implicitly defined by the data. In the context of 2D drawing it provides a new interaction paradigm, map sketching, for editing graphic shapes.To build a planar map, one must compute curve intersections and deduce from them the map they define. The computed topology must be consistent with the underlying geometry. Robustness of geometric computations is a key issue in this process. We present a robust solution to Bézier curve intersection that uses exact forward differencing and bounded rational arithmetic. Then, we describe data structure and algorithms to support incremental insertion of Bézier curves in a planar map. A prototype illustration tool using this method is also discussed.