David Cazier, Jean-François Dufourd  Home/Search
Context
Related
| cg.tuwien.ac.at/~wp/SCCG...Cazier.ps.gz graphics.cs.msu.su/libra...cazier.ps.gz Cached: PS.gz PS PDF DjVu Image Update Help From: cg.tuwien.ac.at/~wp/SCCG96pro... (more) Homepages: D.Cazier J.Dufourd HPSearch (Update Links) |
Rate this article:      (best)Comment on this article |
Abstract: . Algebraic specifications allied to rewriting are used more and more often in design and logical prototyping of programs. We show how these techniques can be applied to a basic problem in computational geometry, namely the construction of planar subdivisions. We build up a simple, complete and convergent system of rules to cope with this problem and show how it is transformed to describe concrete and efficient algorithms such as plane-sweep ones. 1 Introduction Boolean (or set) operations in... (Update)
Active bibliography (related documents): More All
0.6: Reliable boolean operations on polyhedral solids thanks to a.. - Cazier, Dufourd (Correct)
0.5: Formal Specification for Free-Form Curves and Surfaces - Fuchs, Bechmann, Bertrand, .. (Correct)
0.5: Kinematic Chain Substitution for Geometric Constraint Solving - Ogan, Metzger, al. (1998) (Correct)
Similar documents based on text: More All
0.2: The Generalized Baues Problem For Cyclic Polytopes II - Athanasiadis, Rambau, Santos (1998) (Correct)
0.2: The Cayley Trick, Lifting Subdivisions And The Bohne-Dress .. - Huber, Rambau, Santos (1999) (Correct)
0.2: On the refinements of a polyhedral subdivision - Santos (2000) (Correct)
BibTeX entry: (Update)
@inproceedings{ cazier96rewritingbased,
author = "David Cazier and {Jean-Francois} Dufourd",
title = "Rewriting-based derivation of efficient algorithms to build planar subdivisions",
booktitle = "12th Spring Conference on Computer Graphics",
editor = "Werner Purgathofer",
pages = "45--54",
year = "1996",
url = "citeseer.nj.nec.com/1444.html" }
Citations (may not include all citations):681 Rewrite systems - Dershowitz, Jouannaud - 1990
216 Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985
195 Algebraic specifications (context) - Wirsing - 1990
133 Algorithms for reporting and counting geometric intersection.. (context) - Bentley, Ottmann - 1979
101 An optimal algorithm for intersecting line segments in the p.. (context) - Chazelle, Edelsbrunner - 1992
63 volume 6 of EATCS Monograph on Theoretical Computer Science (context) - Ehrig, Mahr et al. - 1985
23 Plane-sweep algorithms for intersecting geometric figures (context) - Nievergelt, Preparata - 1982
13 Incremental computation of planar maps - Gangnet, Herv'e et al. - 1989
13 Proving termination (context) - Bevers, Lewi - 1993
12 Formal specification of interactive graphic programming lang.. (context) - Mallgren - 1982
11 Topological models for boundary representation : a compariso.. (context) - Lienhardt - 1991
2 CVGIP : Graphical Models and Image Processing (context) - Bertrand, Dufourd et al. - 1994
2 A rewrite system to build planar subdivisions (context) - Cazier, Dufourd - 1995
2 Using geometric rewrite rules for solving geometric problems.. (context) - Bruderlin - 1993
2 Formal specification of a small example based on GKS (context) - Duce, Fielding et al. - 1988
1 A digitization algorithm for the entry of planar maps (context) - Dufourd, Gross et al. - 1989
Documents on the same site (http://www.cg.tuwien.ac.at/~wp/SCCG96-proceedings/): More
Criticism Of Hunting Minimum Weight Triangulation Edges - Andrej Ferko (Correct)
D structured meshes for the FEM - Kolcun Stav (Correct)
Autostereograms - Classification and Experimental.. - Tonnhofer, Gröller (Correct)
Online articles have much greater impact More about CiteSeer Add search form to your site Submit documents Feedback
CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute