%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "1.62",
%%% date = "04 September 2009",
%%% time = "15:17:33 MDT",
%%% filename = "tog.bib",
%%% address = "University of Utah
%%% Department of Mathematics, 110 LCB
%%% 155 S 1400 E RM 233
%%% Salt Lake City, UT 84112-0090
%%% USA",
%%% telephone = "+1 801 581 5254",
%%% FAX = "+1 801 581 4148",
%%% URL = "http://www.math.utah.edu/~beebe",
%%% checksum = "52272 37139 180426 1691441",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% license = "public domain",
%%% supported = "yes",
%%% docstring = "This is a COMPLETE BibTeX bibliography for
%%% ACM Transactions on Graphics (CODEN ATGRDF,
%%% ISSN 0730-0301), covering all journal issues
%%% from 1982 -- date.
%%%
%%% At version 1.62, the COMPLETE journal
%%% coverage looked like this:
%%%
%%% 1982 ( 20) 1992 ( 25) 2002 ( 81)
%%% 1983 ( 15) 1993 ( 17) 2003 ( 106)
%%% 1984 ( 17) 1994 ( 20) 2004 ( 104)
%%% 1985 ( 15) 1995 ( 19) 2005 ( 133)
%%% 1986 ( 16) 1996 ( 16) 2006 ( 115)
%%% 1987 ( 18) 1997 ( 15) 2007 ( 128)
%%% 1988 ( 15) 1998 ( 12) 2008 ( 166)
%%% 1989 ( 22) 1999 ( 14) 2009 ( 106)
%%% 1990 ( 28) 2000 ( 13)
%%% 1991 ( 20) 2001 ( 10)
%%%
%%% Article: 1286
%%%
%%% Total entries: 1286
%%%
%%% The journal Web page can be found at:
%%%
%%% http://www.acm.org/pubs/tog
%%%
%%% The journal table of contents page is at:
%%%
%%% http://www.acm.org/pubs/tog/TOC.html
%%%
%%% The article and Web site searcher is at:
%%%
%%% http://www.acm.org/pubs/tog/search.html
%%%
%%% The ACM Portal database site for the journal is at:
%%%
%%% http://portal.acm.org/browse_dl.cfm?idx=J778
%%%
%%% Qualified subscribers can retrieve the full
%%% text of recent articles in PDF form.
%%%
%%% The initial draft was extracted from the ACM
%%% Computing Archive CD ROM for the 1980s, with
%%% manual corrections and additions from
%%% bibliographies in the TeX User Group
%%% collection, the author's personal
%%% bibliography files, the OCLC Contents1st
%%% database, and a very large computer science
%%% bibliography collection on ftp.ira.uka.de in
%%% /pub/bibliography to which many people of
%%% have contributed. The snapshot of this
%%% collection was taken on 5-May-1994, and it
%%% consists of 441 BibTeX files, 2,672,675
%%% lines, 205,289 entries, and 6,375
%%% <at>String{} abbreviations, occupying 94.8MB
%%% of disk space. Where multiple sources of a
%%% particular entry existed, field values have
%%% been manually merged to preserve maximal
%%% information.
%%%
%%% The ACM maintains Web pages with journal
%%% tables of contents for 1985--1995 at
%%% http://www.acm.org/pubs/toc. That data has
%%% been automatically converted to BibTeX
%%% form, corrected for spelling and page
%%% number errors, and merged into this file.
%%%
%%% ACM copyrights explicitly permit abstracting
%%% with credit, so article abstracts, keywords,
%%% and subject classifications have been
%%% included in this bibliography wherever
%%% available. Article reviews have been
%%% omitted, until their copyright status has
%%% been clarified.
%%%
%%% bibsource keys in the bibliography entries
%%% below indicate the entry originally came
%%% from the computer science bibliography
%%% archive, even though it has likely since
%%% been corrected and updated.
%%%
%%% URL keys in the bibliography point to
%%% World Wide Web locations of additional
%%% information about the entry.
%%%
%%% BibTeX citation tags are uniformly chosen
%%% as name:year:abbrev, where name is the
%%% family name of the first author or editor,
%%% year is a 4-digit number, and abbrev is a
%%% 3-letter condensation of important title
%%% words. Citation tags were automatically
%%% generated by software developed for the
%%% BibNet Project.
%%%
%%% In this bibliography, entries are sorted in
%%% publication order, using ``bibsort -byvolume.''
%%%
%%% The checksum field above contains a CRC-16
%%% checksum as the first value, followed by the
%%% equivalent of the standard UNIX wc (word
%%% count) utility output of lines, words, and
%%% characters. This is produced by Robert
%%% Solovay's checksum utility."
%%% }
%%% ====================================================================
@Preamble{"\input bibnames.sty"}
%%% ====================================================================
%%% Acknowledgement abbreviations:
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|http://www.math.utah.edu/~beebe/|"}
@String{ack-pb = "Preston Briggs,
Tera Computer Company,
2815 Eastlake East,
Seattle, WA 98102,
USA,
Tel: +1 206 325-0800,
e-mail: \path|preston@tera.com|"}
%%% ====================================================================
%%% Journal abbreviations:
@String{j-TOG = "ACM Transactions on Graphics"}
%%% ====================================================================
%%% Bibliography entries:
@Article{Bergeron:1982:ATG,
author = "R. D. Bergeron",
title = "{Editor}'s Introduction",
journal = j-TOG,
volume = "1",
number = "1",
pages = "1--4",
month = jan,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 13 17:25:58 MDT 1994",
acknowledgement = ack-nhfb,
info = "Association for Computing Machinery, 11 West 42nd St.,
New York, NY, 10036. Published quarterly. Vol. 1, No. 1
(Jan. 1982). Annual subscription: 24 members, US\$65
nonmembers. Single copies: US\$10 members, US\$20
nonmembers ISSN 0730-03010",
review = "ACM CR 39358",
subject = "I.3 Computing Methodologies, COMPUTER GRAPHICS,
General",
}
@Article{Fuchs:1982:GEI,
author = "Henry Fuchs",
title = "{Guest Editor}'s Introduction",
journal = j-TOG,
volume = "1",
number = "1",
pages = "5--6",
month = jan,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 13 17:25:58 MDT 1994",
acknowledgement = ack-nhfb,
}
@Article{Cook:1982:RMC,
author = "R. L. Cook and K. E. Torrance",
title = "A Reflectance Model for Computer Graphics",
journal = j-TOG,
volume = "1",
number = "1",
pages = "7--24",
month = jan,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.82.bib",
keywords = "I37 reflected light and color; shading; TOG",
}
@Article{Sechrest:1982:VPR,
author = "S. Sechrest and D. P. Greenberg",
title = "A Visible Polygon Reconstruction Algorithm",
journal = j-TOG,
volume = "1",
number = "1",
pages = "25--42",
month = jan,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/82.bib",
keywords = "I35 polygon reconstruction algorithm",
}
@Article{Whitted:1982:STD,
author = "T. Whitted and D. M. Weimer",
title = "A Software Testbed for the Development of 3{D} Raster
Graphics Systems",
journal = j-TOG,
volume = "1",
number = "1",
pages = "43--57",
month = jan,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:08:29 1994",
bibsource = "Graphics/siggraph/82.bib",
keywords = "I34 software testbed and I37 3-D shaded display",
}
@Article{Feiner:1982:ESC,
author = "Steven Feiner and Sandor Nagy and Andries van Dam",
title = "An experimental system for creating and presenting
interactive graphical documents",
journal = j-TOG,
volume = "1",
number = "1",
pages = "59--77",
month = jan,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.82.bib",
keywords = "I34 interactive graphical documents",
bibdate = "Fri Oct 31 06:38:49 2003",
}
@Article{Krogh:1982:AAP,
author = "F. T. Krogh",
title = "{ACM} Algorithms Policy",
journal = j-TOG,
volume = "1",
number = "1",
pages = "78--81",
month = jan,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1982:IA,
author = "Anonymous",
title = "Information for Authors",
journal = j-TOG,
volume = "1",
number = "1",
pages = "82--84",
month = jan,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:51:22 1996",
acknowledgement = ack-nhfb,
}
@Article{Potmesil:1982:SIG,
author = "M. Potmesil and I. Chakravarty",
title = "Synthetic Image Generation with a Lens and Aperture
Camera Model",
journal = j-TOG,
volume = "1",
number = "2",
pages = "85--108",
month = apr,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.82.bib",
keywords = "I33 camera model; ray tracing effects; TOG",
}
@Article{Garrett:1982:GPU,
author = "M. T. Garrett and J. D. Foley",
title = "Graphics Programming Using a Database System with
Dependency Declarations",
journal = j-TOG,
volume = "1",
number = "2",
pages = "109--128",
month = apr,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/82.bib",
keywords = "I34 software support and I35 specification of
dependencies",
}
@Article{Hubschman:1982:FFC,
author = "H. Hubschman and S. W. Zucker",
title = "Frame-to-frame coherence and the hidden surface
computation: constraints for a convex world",
journal = j-TOG,
volume = "1",
number = "2",
pages = "129--162",
month = apr,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.82.bib",
keywords = "I37 frame-to-frame coherence",
}
@Article{Wyk:1982:HLL,
author = "Christopher J. Van Wyk",
title = "A High-Level Language for Specifying Pictures",
journal = j-TOG,
volume = "1",
number = "2",
pages = "163--182",
month = apr,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Misc/beebe.bib",
}
@Article{Baecker:1982:SPR,
author = "R. M. Baecker",
title = "Sizing and Positioning Rectangles",
journal = j-TOG,
volume = "1",
number = "2",
pages = "184--185",
month = apr,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.82.bib",
keywords = "I36 Input Technique",
}
@Article{Evans:1982:R,
author = "Peter P. Tanner and Kenneth B. Evans",
title = "The Rack",
journal = j-TOG,
volume = "1",
number = "2",
pages = "186--188",
month = apr,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 6 16:39:10 1996",
bibsource = "Graphics/siggraph/82.bib",
keywords = "I37 Input Techniques",
}
@Article{Bergeron:1982:EI,
author = "R. Daniel Bergeron",
title = "{Editor}'s Introduction",
journal = j-TOG,
volume = "1",
number = "3",
pages = "189--189",
month = jul,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 16:39:30 1996",
acknowledgement = ack-nhfb,
}
@Article{Guibas:1982:LBM,
author = "L. J. Guibas and J. Stolfi",
title = "A language for bitmap manipulation",
journal = j-TOG,
volume = "1",
number = "3",
pages = "191--214",
month = jul,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 13 17:25:58 MDT 1994",
acknowledgement = ack-nhfb,
keywords = "algorithms; languages; standardization",
review = "ACM CR 39952",
subject = "D.3 Software, PROGRAMMING LANGUAGES, Language
Classifications \\ I.3.4 Computing Methodologies,
COMPUTER GRAPHICS, Graphics Utilities, Graphics
packages \\ I.3.4 Computing Methodologies, COMPUTER
GRAPHICS, Graphics Utilities, Picture description
languages \\ I.3.4 Computing Methodologies, COMPUTER
GRAPHICS, Graphics Utilities, Software support \\ I.3.6
Computing Methodologies, COMPUTER GRAPHICS, Methodology
and Techniques, Languages \\ I.4.0 Computing
Methodologies, IMAGE PROCESSING, General, Image
processing software",
}
@Article{Turkowski:1982:AAT,
author = "K. Turkowski",
title = "Anti-Aliasing through the Use of Coordinate
Transformations",
journal = j-TOG,
volume = "1",
number = "3",
pages = "215--234",
month = jul,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:07:27 1994",
bibsource = "Graphics/imager/imager.82.bib",
keywords = "I35 anti-aliasing convolution",
}
@Article{Blinn:1982:GAS,
author = "James F. Blinn",
title = "A Generalization of Algebraic Surface Drawing",
journal = j-TOG,
volume = "1",
number = "3",
pages = "235--256",
month = jul,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.82.bib",
annote = "ray tracing ``blobby'' models: finding roots of sums
of Gaussians",
keywords = "blob; I33 light reflection; I33 realism clouds; model
visible; root finding; TOG",
}
@Article{Sproull:1982:UPT,
author = "R. F. Sproull",
title = "Using program transformations to derive line-drawing
algorithms",
journal = j-TOG,
volume = "1",
number = "4",
pages = "259--273",
month = oct,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.82.bib",
keywords = "I33 display algorithms",
}
@Article{Anderson:1982:HLE,
author = "D. P. Anderson",
title = "Hidden Line Elimination in Projected Grid Surfaces",
journal = j-TOG,
volume = "1",
number = "4",
pages = "274--288",
month = oct,
year = "1982",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/82.bib",
keywords = "I37 hidden line algorithms",
}
@Article{Pavlidis:1983:CFC,
author = "Theodosios Pavlidis",
title = "Curve Fitting with Conic Splines",
journal = j-TOG,
volume = "2",
number = "1",
pages = "1--31",
month = jan,
year = "1983",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.83.bib",
keywords = "I35 B{\'e}zier polynomials; I35 splines",
}
@Article{Sproull:1983:D,
author = "R. F. Sproull and I. E. Sutherland and A. Thomson and
S. Gupta and C. Minter",
title = "The 8 by 8 display",
journal = j-TOG,
volume = "2",
number = "1",
pages = "32--56",
month = jan,
year = "1983",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.83.bib",
keywords = "frame-buffer; I32 display system",
}
@Article{Carlbom:1983:QAV,
author = "I. Carlbom and J. Michener",
title = "Quantitative Analysis of Vector Graphics System
Performance",
journal = j-TOG,
volume = "2",
number = "1",
pages = "57--88",
month = jan,
year = "1983",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/83.bib",
keywords = "I32 system performance evaluations and I36 addressing
schemes",
}
@Article{Tanner:1983:GEI,
author = "Peter P. Tanner",
title = "Guest Editor Introduction",
journal = j-TOG,
volume = "2",
number = "2",
pages = "89--89",
month = apr,
year = "1983",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 16:44:13 1996",
acknowledgement = ack-nhfb,
}
@Article{Reeves:1983:PST,
author = "W. T. Reeves",
title = "Particle Systems -- a Technique for Modeling a Class
of Fuzzy Objects",
journal = j-TOG,
volume = "2",
number = "2",
pages = "91--108",
month = apr,
year = "1983",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/83.bib",
keywords = "I35 particle systems and I35 fuzzy objects and I37
aliasing and I37 clouds and I37 fire and I35 particle
systems and I37 temporal antialiasing and I37 water",
}
@Article{Barsky:1983:LCB,
author = "Brian A. Barsky and John C. Beatty",
title = "Local Control of Bias and Tension in Beta-splines",
journal = j-TOG,
volume = "2",
number = "2",
pages = "109--134",
month = apr,
year = "1983",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:10:04 1994",
bibsource = "Graphics/imager/imager.83.bib",
annote = "Also published in SIGGRAPH '83 Conference Proceedings
(Vol. 17, No. 3).",
keywords = "algorithms; CAD/CAM; curves and surfaces; design and
modeling; differential geometry; I35 splines",
}
@Article{Pike:1983:GOB,
author = "R. Pike",
title = "Graphics in overlapping bitmap layers",
journal = j-TOG,
volume = "2",
number = "2",
pages = "135--160",
month = apr,
year = "1983",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.83.bib",
keywords = "bit blit; I33 asynchronous windows; I35 low-level
graphics primitives; I36 bitmap layers",
}
@Article{Kajiya:1983:NTR,
author = "James T. Kajiya",
title = "New Techniques for Ray Tracing Procedurally Defined
Objects",
journal = j-TOG,
volume = "2",
number = "3",
pages = "161--181",
month = jul,
year = "1983",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:12:20 1994",
bibsource = "Graphics/ray.bib",
note = "Also appeared in SIGGRAPH '83 Proceedings, and in
Tutorial: Computer Graphics: Image Synthesis, Computer
Society Press, Washington, 1988, pp. 168--188.",
keywords = "fractal; object intersection; prism; ray tracing;
surfaces of revolution",
}
@Article{Prosser:1983:IMG,
author = "Colin J. Prosser and Alistair C. Kilgour",
title = "An Integer Method for the Graphical Output of Conic
Sections",
journal = j-TOG,
volume = "2",
number = "3",
pages = "182--191",
month = jul,
year = "1983",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 6 16:45:56 1996",
bibsource = "Graphics/siggraph/83.bib",
keywords = "I35 conic section definitions and I35 curve
generation",
}
@Article{Lane:1983:AFR,
author = "J. M. Lane and R. Magedson and M. Rarick",
title = "An Algorithm for Filling Regions on Graphics Display
Devices",
journal = j-TOG,
volume = "2",
number = "3",
pages = "192--196",
month = jul,
year = "1983",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:13:47 1994",
bibsource = "Graphics/siggraph/83.bib",
keywords = "I35 shaded polygons; I37 filling algorithms",
}
@Article{Anderson:1983:TRP,
author = "D. P. Anderson",
title = "Techniques for Reducing Pen Plotting Time",
journal = j-TOG,
volume = "2",
number = "3",
pages = "197--212",
month = jul,
year = "1983",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/83.bib",
keywords = "I35 quadtrees and I36 plot minimisation",
}
@Article{Anonymous:1983:IA,
author = "Anonymous",
title = "Information for Authors",
journal = j-TOG,
volume = "2",
number = "3",
pages = "213--216",
month = jul,
year = "1983",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:51:22 1996",
acknowledgement = ack-nhfb,
}
@Article{Burt:1983:MSA,
author = "P. J. Burt and E. H. Adelson",
title = "A multiresolution spline with application to image
mosaics",
journal = j-TOG,
volume = "2",
number = "4",
pages = "217--236",
month = oct,
year = "1983",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.83.bib",
keywords = "I33 Image Mosaics; I35 Multiresolution Splines; I35
Splines",
}
@Article{McIlroy:1983:BAC,
author = "M. McIlroy",
title = "Best Approximate Circles on Integer Grids",
journal = j-TOG,
volume = "2",
number = "4",
pages = "237--263",
month = oct,
year = "1983",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:14:04 1994",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory; verification",
review = "ACM CR 8502-0147",
subject = "I.3 Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation \\ F.2.2 Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Geometrical problems and computations",
}
@Article{Dunlavey:1983:EPF,
author = "M. R. Dunlavey",
title = "Efficient Polygon-Filling Algorithms for Raster
Displays",
journal = j-TOG,
volume = "2",
number = "4",
pages = "264--273",
month = oct,
year = "1983",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/83.bib",
keywords = "I37 Filling Algorithm",
}
@Article{Liang:1984:NCM,
author = "Y.-D. Liang and B. A. Barsky",
title = "A New Concept and Method for Line Clipping",
journal = j-TOG,
volume = "3",
number = "1",
pages = "1--22",
month = jan,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:22:24 1994",
bibsource = "Graphics/siggraph/84.bib",
keywords = "I33 Line Clipping",
}
@Article{Lantz:1984:SGD,
author = "K. A. Lantz and W. I. Nowicki",
title = "Structured Graphics for Distributed Systems",
journal = j-TOG,
volume = "3",
number = "1",
pages = "23--51",
month = jan,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.84.bib",
keywords = "I32 distributed systems; I32 workstations; I36 user
interfaces",
}
@Article{Weghorst:1984:ICM,
author = "Hank Weghorst and Gary Hooper and Donald P.
Greenberg",
title = "Improved Computational Methods for Ray Tracing",
journal = j-TOG,
volume = "3",
number = "1",
pages = "52--69",
month = jan,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.84.bib",
annote = "discussion of bounding volumes, hierarchical
structures and the ``item buffer'' \\ This paper
describes algorithmic procedures that have been
implemented to reduce the computational expense of
producing ray-traced images. The selection of bounding
volumes is examined to reduce the computational cost of
the ray-intersection test. The use of object coherence,
which relies on a hierarchical description of the
environment, is then presented. Finally, since the
building of the ray-intersection trees is such a large
portion of the computation, a method using image
coherence is described. This visible-surface
preprocessing method, which is dependent upon the
creation of an ``item buffer,'' takes advantage of {\em
a priori} image formation. Examples that indicate the
efficiency of these techniques for a variety of
representative environments are presented.",
keywords = "bounding volume; I35 Ray Tracing",
}
@Article{Levy:1984:VSG,
author = "H. M. Levy",
title = "{Vax} Station: {A} General-Purpose Raster Graphics
Architecture",
journal = j-TOG,
volume = "3",
number = "1",
pages = "70--83",
month = jan,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.84.bib",
keywords = "I32 raster graphics architecture; I32 workstations",
}
@Article{Edahiro:1984:NPL,
author = "M. Edahiro and I. Kokubo and Ta. Asano",
title = "A new point-location algorithm and its practical
efficiency: comparison with existing algorithms",
journal = j-TOG,
volume = "3",
number = "2",
pages = "86--109",
month = apr,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:17:50 1994",
bibsource = "Graphics/siggraph/84.bib",
keywords = "bucketing; computational complexity; computational
geometry; implementing algorithms; multidimensional
search; planar graphs; point location; VLSI design",
}
@Article{Ghosh:1984:BTA,
author = "P. K. Ghosh and S. P. Mudur",
title = "The Bush-Trajectory Approach to Figure Specification:
Some Algebraic Solutions",
journal = j-TOG,
volume = "3",
number = "2",
pages = "110--134",
month = apr,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.84.bib",
keywords = "I37 figure specification",
}
@Article{Chazelle:1984:TSC,
author = "B. Chazelle and J. Incerpi",
title = "Triangulation and shape-complexity",
journal = j-TOG,
volume = "3",
number = "2",
pages = "135--152",
month = apr,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/84.bib",
keywords = "decomposition; divide-and-conquer; polygons; simple;
triangulation",
oldlabel = "geom-1055",
}
@Article{Fournier:1984:TSP,
author = "A. Fournier and D. Y. Montuno",
title = "Triangulating Simple Polygons and Equivalent
Problems",
journal = j-TOG,
volume = "3",
number = "2",
pages = "153--174",
month = apr,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.84.bib",
annote = "Also, DGP Technical Memo DGP84--4.",
keywords = "computational geometry; decomposition; scan
conversion; trapezoid",
}
@Article{Olsen:1984:PAU,
author = "Dan R. {Olsen, Jr.}",
title = "Pushdown automata for user interface management",
journal = j-TOG,
volume = "3",
number = "3",
pages = "177--203",
month = jul,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/84.bib",
keywords = "automata; graphical device handling; interaction",
}
@Article{Goldman:1984:MCC,
author = "Ronald N. Goldman",
title = "Markov Chains and Computer-Aided Geometric Design:
Part {I} - Problems and Constraints",
journal = j-TOG,
volume = "3",
number = "3",
pages = "204--222",
month = jul,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:20:34 1994",
bibsource = "Graphics/siggraph/84.bib",
keywords = "probability distribution; stochastic process",
}
@Article{vanWijk:1984:RTO,
author = "Jarke J. van Wijk",
title = "Ray Tracing Objects Defined By Sweeping Planar Cubic
Splines",
journal = j-TOG,
volume = "3",
number = "3",
pages = "223--237",
month = jul,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 13:10:45 1996",
bibsource = "Graphics/imager/imager.84.bib,
Graphics/siggraph/85.bib",
annote = "ray tracing prisms, cones, and surfaces of revolution
\\ The crucial step in a program based on ray tracing
is the calculation of the intersection of a line with
an object. In this paper, algorithms are presented for
performing this calculation for objects defined by
sweeping a planar cubic spline through space.
Translational, rotational, and conic sweeping are
treated. Besides solutions for the exact calculation,
rectangle tests for improving efficiency are given.
Possible extensions and improvements are discussed.",
keywords = "cones; I37 ray-tracing and I35 sweeping planar cubic
splines; object intersection; prisms; ray tracing
intersect sweep; spline; surfaces of revolution; TOG",
}
@Article{Anonymous:1984:IA,
author = "Anonymous",
title = "Information for Authors",
journal = j-TOG,
volume = "3",
number = "3",
pages = "238--240",
month = jul,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 13:10:43 1996",
acknowledgement = ack-nhfb,
}
@Article{Forrest:1984:GEI,
author = "Robin Forrest and Leo Guibas and Jurg Nievergelt",
title = "{Guest Editor}'s Introduction to Special Issue on
Computational Geometry",
journal = j-TOG,
volume = "3",
number = "4",
pages = "241--243",
month = oct,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 16:50:37 1996",
acknowledgement = ack-nhfb,
}
@Article{Tor:1984:CDS,
author = "S. B. Tor and A. E. Middleditch",
title = "Convex Decomposition of Simple Polygons",
journal = j-TOG,
volume = "3",
number = "4",
pages = "244--265",
month = oct,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.84.bib",
keywords = "complexity; geometric modeling; geometrical convexity;
I35 convex decomposition; point set operations;
polygons; region decomposition",
}
@Article{Boissonnat:1984:GST,
author = "Jean-Daniel Boissonnat",
title = "Geometric structures for three-dimensional shape
representation",
journal = j-TOG,
volume = "3",
number = "4",
pages = "266--286",
month = oct,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.84.bib",
keywords = "$k-d$ tree; computational geometry; Delaunay
triangulation; polyhedra",
}
@Article{Lee:1984:AFE,
author = "Y. T. Lee and A. de Pennington and N. K. Shaw",
title = "Automatic finite-element mesh generation from
geometric models --- {A} point-based approach",
journal = j-TOG,
volume = "3",
number = "4",
pages = "287--311",
month = oct,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.84.bib",
keywords = "computational geometry; CSG; finite-element analysis;
geometric modeling; mesh construction; point
distribution",
}
@Article{Badler:1984:WC,
author = "Norman I. Badler and Tamar E. Granor",
title = "The window controller",
journal = j-TOG,
volume = "3",
number = "4",
pages = "312--315",
month = oct,
year = "1984",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/84.bib",
}
@Article{Field:1985:ILI,
author = "Dan Field",
title = "Incremental Linear Interpolation",
journal = j-TOG,
volume = "4",
number = "1",
pages = "1--11",
month = jan,
year = "1985",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:29:02 1994",
bibsource = "Graphics/siggraph/85.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/3976.html",
keywords = "Bresenham's algorithm; digital differential analyzer;
scan conversion",
subject = "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
ANALYSIS, Interpolation. {\bf G.1.0}: Mathematics of
Computing, NUMERICAL ANALYSIS, General, Error analysis.
{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display
algorithms.",
}
@Article{Goldman:1985:MCC,
author = "R. N. Goldman",
title = "Markov Chains and Computer Aided Geometric Design {II}
--- Examples and Subdivision Matrices",
journal = j-TOG,
volume = "4",
number = "1",
pages = "12--40",
month = jan,
year = "1985",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.85.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/3974.html",
keywords = "design; I37 Markov processes; I37 stochastic
processes; probability distribution; stochastic
process; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Geometrical problems and computations. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD).",
}
@Article{Ayala:1985:ORM,
author = "D. Ayala and P. Brunet and R. Juan and I. Navazo",
title = "Object representation by means of nonminimal division
quadtrees and octrees",
journal = j-TOG,
volume = "4",
number = "1",
pages = "41--59",
month = jan,
year = "1985",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.85.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/3975.html",
keywords = "algorithms; geometric modeling",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems. {\bf I.3.5}:
Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Modeling
packages. {\bf I.3.3}: Computing Methodologies,
COMPUTER GRAPHICS, Picture/Image Generation, Display
algorithms.",
}
@Article{Woo:1985:LTA,
author = "T. C. Woo and S. Y. Shin",
title = "A Linear Time Algorithm for Triangulating a
Point-Visible Polygon",
journal = j-TOG,
volume = "4",
number = "1",
pages = "60--69",
month = jan,
year = "1985",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 6 16:58:51 1996",
bibsource = "Graphics/siggraph/85.bib",
keywords = "computational geometry; triangulation",
}
@Article{Anonymous:1985:AI,
author = "Anonymous",
title = "Author Index",
journal = j-TOG,
volume = "4",
number = "1",
pages = "71--72",
month = jan,
year = "1985",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 15:42:46 1996",
bibsource = "Graphics/siggraph/85.bib",
acknowledgement = ack-nhfb,
}
@Article{Guibas:1985:PMG,
author = "Leonidas Guibas and Jorge Stolfi",
title = "Primitives for the manipulation of general
subdivisions and computation of {Voronoi} diagrams",
journal = j-TOG,
volume = "4",
number = "2",
pages = "74--123",
month = apr,
year = "1985",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:30:45 1994",
bibsource = "Graphics/imager/imager.85.bib",
keywords = "closest point; computational topology; convex hull;
data structuring; Delaunay diagrams; design of
algorithms; Euler operators; geometric primitives;
nearest neighbors; planar graphs; point location;
representation of polyhedra; triangulations",
}
@Article{Nishita:1985:SMP,
author = "T. Nishita and I. Okamura and E. Nakamae",
title = "Shading Models for Point and Linear Sources",
journal = j-TOG,
volume = "4",
number = "2",
pages = "124--146",
month = apr,
year = "1985",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 02:08:52 1994",
bibsource = "Graphics/imager/imager.85.bib",
keywords = "I37 shading models; lighting simulation; luminous
intensity distribution",
}
@Article{Aken:1985:CDA,
author = "J. Van Aken and M. Novak",
title = "Curve-Drawing Algorithms for Raster Displays",
journal = j-TOG,
volume = "4",
number = "2",
pages = "147--169",
month = apr,
year = "1985",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.85.bib",
annote = "Corrections in TOG 1987 vol.6 no.1, p.80",
keywords = "I35 curve drawing algorithms",
}
@Article{Cohen:1985:ADR,
author = "Elaine Cohen and Tom Lyche and Larry L. Schumaker",
title = "Algorithms for degree-raising of splines",
journal = j-TOG,
volume = "4",
number = "3",
pages = "171--181",
month = jul,
year = "1985",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.85.bib",
keywords = "B-spline; subdivision",
}
@Article{Samet:1985:SCP,
author = "Hanan Samet and Robert E. Webber",
title = "Storing a collection of polygons using quadtrees",
journal = j-TOG,
volume = "4",
number = "3",
pages = "182--222",
month = jul,
year = "1985",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.85.bib,
Graphics/siggraph/82.bib",
keywords = "geographic information; hierarchical data structures;
line representations; map overlay; polygonal
representations",
}
@Article{Goldman:1985:IEV,
author = "Ronald N. Goldman",
title = "Illicit expressions in vector algebra",
journal = j-TOG,
volume = "4",
number = "3",
pages = "223--243",
month = jul,
year = "1985",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.85.bib",
keywords = "vector geometry",
}
@Article{Anonymous:1985:CP,
author = "Anonymous",
title = "Call for Papers",
journal = j-TOG,
volume = "4",
number = "3",
pages = "244--244",
month = jul,
year = "1985",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 15:44:00 1996",
acknowledgement = ack-nhfb,
}
@Article{Robertson:1985:ASS,
author = "Philip K. Robertson and John F. O'Callaghan",
title = "The Application of Scene Synthesis Techniques to the
Display of Multidimensional Image Data",
journal = j-TOG,
volume = "4",
number = "4",
pages = "247--274",
month = oct,
year = "1985",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:33:57 1994",
note = "See corrigenda \cite{Robertson:1987:CAS}.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/6117.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; I30 picture processing; I37 realism; I37
scene synthesis; theory",
review = "ACM CR 8704-0311",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation. {\bf H.1.2}:
Information Systems, MODELS AND PRINCIPLES,
User/Machine Systems.",
}
@Article{Patterson:1985:PTP,
author = "Richard R. Patterson",
title = "Projective Transformations of the Parameter of a
{Bernstein}-{B{\'e}zier} Curve",
journal = j-TOG,
volume = "4",
number = "4",
pages = "276--290",
month = oct,
year = "1985",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:33:07 1994",
bibsource = "Graphics/siggraph/86.bib",
note = "See corrigendum \cite{Patterson:1987:CTP}.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/6119.html",
acknowledgement = ack-nhfb,
keywords = "design; I35 Bernstein-B{\'e}zier curve; I35 projective
transformations; theory",
review = "ACM CR 8704-0312",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Geometrical problems and computations.",
}
@Article{Bronsvoort:1985:RTG,
author = "Willem F. Bronsvoort and Fopke Klok",
title = "Ray Tracing Generalized Cylinders",
journal = j-TOG,
volume = "4",
number = "4",
pages = "291--303",
month = oct,
year = "1985",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:27:04 1994",
bibsource = "Graphics/imager/imager.85.bib",
note = "See corrigendum \cite{Bronsvoort:1987:CTG}.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/6118.html",
acknowledgement = ack-nhfb,
annote = "An algorithm is presented for ray tracing generalized
cylinders, that is, objects defined by sweeping a
two-dimensional contour along a three-dimensional
trajectory. The contour can be any ``well-behaved''
curve in the sense that it is continuous, and that the
points where the tangent is horizontal or vertical can
be determined; the trajectory can be any spline curve.
First a definition is given of generalized cylinders in
terms of the Frenet frame of the trajectory. Then the
main problem in ray tracing these objects, the
computation of the intersection points with a ray, is
reduced to the problem of intersecting two
two-dimensional curves. This problem is solved by a
subdivision algorithm. The three-dimensional normal at
the intersection point closest to the eye point,
necessary to perform the shading, is obtained by
transforming the two-dimensional normal at the
corresponding intersection point of the two
two-dimensional curves. In this way it is possible to
obtain highly realistic images for a very broad class
of objects.",
keywords = "algorithms; design; Frenet frame; human factors; I37
ray tracing; object intersection; solid modeling;
splines; theory",
review = "ACM CR 8708-0703",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems. {\bf I.3.5}:
Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Modeling
packages. {\bf I.3.7}: Computing Methodologies,
COMPUTER GRAPHICS, Three-Dimensional Graphics and
Realism, Color, shading, shadowing, and texture. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD). {\bf I.3.7}:
Computing Methodologies, COMPUTER GRAPHICS,
Three-Dimensional Graphics and Realism, Visible
line/surface algorithms.",
}
@Article{Mantyla:1986:BOT,
author = "Martti Mantyla",
title = "{Boolean} operations of 2-manifolds through vertex
neighborhood classification",
journal = j-TOG,
volume = "5",
number = "1",
pages = "1--29",
month = jan,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:47:29 1994",
bibsource = "Graphics/imager/imager.86.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/7530.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; set operations; shape operations; solid
modeling",
review = "ACM CR 8707-0610",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD). {\bf F.2.2}:
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Geometrical problems and computations.",
}
@Article{Meyer:1986:EEC,
author = "Gary W. Meyer and Holly E. Rushmeier and Michael F.
Cohen and Donald P. Greenberg and Kenneth E. Torrance",
title = "An Experimental Evaluation of Computer Graphics
Imagery",
journal = j-TOG,
volume = "5",
number = "1",
pages = "30--50",
month = jan,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:47:53 1994",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/7920.html",
acknowledgement = ack-nhfb,
annote = "side-by-side test of reality vs. a radiosity image",
keywords = "experimentation; human factors; measurement;
verification",
review = "ACM CR 8707-0608",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Viewing algorithms.
{\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques, Ergonomics. {\bf
I.3.7}: Computing Methodologies, COMPUTER GRAPHICS,
Three-Dimensional Graphics and Realism, Color, shading,
shadowing, and texture. {\bf I.4.8}: Computing
Methodologies, IMAGE PROCESSING, Scene Analysis,
Photometry. {\bf I.2.10}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Vision and Scene
Understanding, Intensity, color, photometry, and
thresholding.",
}
@Article{Cook:1986:SSC,
author = "Robert L. Cook",
title = "Stochastic Sampling in Computer Graphics",
journal = j-TOG,
volume = "5",
number = "1",
pages = "51--72",
month = jan,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:39:28 1994",
note = "See remarks \cite{Pavlidis:1990:RCS,Wold:1990:RCS}.
Also in Tutorial: Computer Graphics: Image Synthesis,
Computer Society Press, Washington, 1988, pp.
283--304.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/8927.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; antialiasing; depth of field; filtering;
image synthesis; Monte Carlo integration; motion blur;
raster graphics; ray tracing; stochastic sampling",
review = "ACM CR 8709-0784",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Viewing algorithms.
{\bf G.3}: Mathematics of Computing, PROBABILITY AND
STATISTICS, Probabilistic algorithms (including Monte
Carlo).",
}
@Article{Foley:1986:GEIa,
author = "James Foley",
title = "{Guest Editor}'s Introduction: Special Issue on User
Interface Software",
journal = j-TOG,
volume = "5",
number = "2",
pages = "75--78",
month = apr,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 17:02:57 1996",
acknowledgement = ack-nhfb,
}
@Article{Scheifler:1986:XWS,
author = "Robert W. Scheifler and Jim Gettys",
title = "The {X} Window System",
journal = j-TOG,
volume = "5",
number = "2",
pages = "79--109",
month = apr,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:51:29 1994",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/24053.html",
acknowledgement = ack-nhfb,
annote = "An overview of the X Window System is presented,
focusing on the system substrate and the low-level
facilities provided to build applications and to manage
the desktop. The system provides high-performance,
high-level, device-independent graphics. A hierarchy of
resizable, overlapping windows allows a wide variety of
application and user interfaces to be built easily.
Network-transparent access to the display provides an
important degree of functional separation, without
significantly affecting performance, which is crucial
to building applications for a distributed environment.
To a reasonable extent, desktop management can be
custom-tailored to individual environments, without
modifying the base system and typically without
affecting applications.",
keywords = "communication management; computer graphics;
computer-communication networks; design; device
independence; distributed applications; distributed
systems; distributed/network graphics; experimentation;
graphics packages; graphics systems; graphics
utilities; human factors; interaction techniques;
methodology and techniques; models and principles;
network communication; network protocols; operating
systems; protocol architecture; software support;
standardization; terminal management; user/machine
systems; virtual terminals; window managers; window
systems",
review = "ACM CR 8803-0219",
subject = "{\bf I.3.2}: Computing Methodologies, COMPUTER
GRAPHICS, Graphics Systems, Distributed/network
graphics. {\bf D.4.4}: Software, OPERATING SYSTEMS,
Communications Management, Terminal management. {\bf
H.1.2}: Information Systems, MODELS AND PRINCIPLES,
User/Machine Systems, Human factors. {\bf I.3.4}:
Computing Methodologies, COMPUTER GRAPHICS, Graphics
Utilities, Graphics packages. {\bf I.3.4}: Computing
Methodologies, COMPUTER GRAPHICS, Graphics Utilities,
Software support. {\bf I.3.6}: Computing Methodologies,
COMPUTER GRAPHICS, Methodology and Techniques, Device
independence. {\bf I.3.6}: Computing Methodologies,
COMPUTER GRAPHICS, Methodology and Techniques,
Interaction techniques.",
}
@Article{Mackinlay:1986:ADG,
author = "Jock Mackinlay",
title = "Automating the Design of Graphical Presentations of
Relational Information",
journal = j-TOG,
volume = "5",
number = "2",
pages = "110--141",
month = apr,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:46:30 1994",
bibsource = "Graphics/siggraph/86.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/22950.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; applications and expert systems;
artificial intelligence; automatic generation;
composition algebra; computer graphics; design; device
independence; effectiveness; ergonomics;
expressiveness; graphic design; human factors; human
information processing; information presentation;
information storage and retrieval; languages;
methodology and techniques; models and principles;
presentation tool; software engineering; systems and
software; theory; tools and techniques; user interface;
user interfaces; user/machine systems",
subject = "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
Techniques, User interfaces. {\bf H.1.2}: Information
Systems, MODELS AND PRINCIPLES, User/Machine Systems,
Human information processing. {\bf H.3.4}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Systems and
Software. {\bf I.2.1}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Applications and Expert
Systems. {\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques, Device
independence. {\bf I.3.6}: Computing Methodologies,
COMPUTER GRAPHICS, Methodology and Techniques,
Ergonomics.",
}
@Article{Barth:1986:OAG,
author = "Paul S. Barth",
title = "An Object-Oriented Approach to Graphical Interfaces",
journal = j-TOG,
volume = "5",
number = "2",
pages = "142--172",
month = apr,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:37:27 1994",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/22951.html",
acknowledgement = ack-nhfb,
keywords = "computer graphics; design; extensible languages;
graphical constraints; graphical interfaces; graphics
utilities; language classifications; languages;
methodology and techniques; object-oriented graphics;
programming languages; software reusability; software
support",
review = "ACM CR 8803-0185",
subject = "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
Classifications. {\bf I.3.6}: Computing Methodologies,
COMPUTER GRAPHICS, Methodology and Techniques,
Languages. {\bf I.3.4}: Computing Methodologies,
COMPUTER GRAPHICS, Graphics Utilities, Software
support. {\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques, GROW. {\bf
D.3.2}: Software, PROGRAMMING LANGUAGES, Language
Classifications, Extensible languages.",
}
@Article{Foley:1986:GEIb,
author = "James Foley",
title = "{Guest Editor}'s Introduction: Special Issue on User
Interface Software",
journal = j-TOG,
volume = "5",
number = "3",
pages = "175--178",
month = jul,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 17:04:13 1996",
acknowledgement = ack-nhfb,
}
@Article{Hill:1986:SCC,
author = "Ralph D. Hill",
title = "Supporting Concurrency, Communication, and
Synchronization in Human-Computer Interaction -- the
{Sassafras} {UIMS}",
journal = j-TOG,
volume = "5",
number = "3",
pages = "179--210",
month = jul,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:44:29 1994",
bibsource = "Graphics/siggraph/86.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/24055.html",
acknowledgement = ack-nhfb,
keywords = "computer graphics; concurrency; design;
experimentation; human factors; information systems;
interaction techniques; languages; message passing;
methodology and techniques; software engineering; tools
and techniques; user interface management systems; user
interfaces; user/machine systems",
review = "ACM CR 8712-0990",
subject = "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
Techniques, Sassafras. {\bf I.3.6}: Computing
Methodologies, COMPUTER GRAPHICS, Methodology and
Techniques, Languages. {\bf I.3.6}: Computing
Methodologies, COMPUTER GRAPHICS, Methodology and
Techniques, Interaction techniques. {\bf H.1.2}:
Information Systems, MODELS AND PRINCIPLES,
User/Machine Systems, Human factors. {\bf H.1.2}:
Information Systems, MODELS AND PRINCIPLES,
User/Machine Systems, UIMS.",
}
@Article{Henderson:1986:RUM,
author = "D. Austin {Henderson, Jr.} and Stuart K. Card",
title = "Rooms: the Use of Multiple Virtual Workspaces to
Reduce Space Contention in a Window-Based Graphical
User Interface",
journal = j-TOG,
volume = "5",
number = "3",
pages = "211--243",
month = jul,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:42:58 1994",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/24056.html",
acknowledgement = ack-nhfb,
keywords = "bounded locality interval; computer graphics; design;
desktop; ergonomics; human factors; human information
processing; interaction techniques; locality set;
methodology and technique; models and principles;
operating systems; project views; resource contention;
rooms; storage management; theory; user/machine
systems; virtual memory; virtual workspace windows;
window manager; working set",
subject = "{\bf D.4.2}: Software, OPERATING SYSTEMS, Storage
Management, Virtual memory. {\bf H.1.2}: Information
Systems, MODELS AND PRINCIPLES, User/Machine Systems,
Human factors. {\bf H.1.2}: Information Systems, MODELS
AND PRINCIPLES, User/Machine Systems, Human information
processing. {\bf I.3.6}: Computing Methodologies,
COMPUTER GRAPHICS, Methodology and Techniques,
Ergonomics. {\bf I.3.6}: Computing Methodologies,
COMPUTER GRAPHICS, Methodology and Techniques,
Interaction techniques.",
}
@Article{Green:1986:STD,
author = "Mark Green",
title = "A Survey of Three Dialogue Models",
journal = j-TOG,
volume = "5",
number = "3",
pages = "244--275",
month = jul,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:41:43 1994",
bibsource = "Graphics/siggraph/86.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/24057.html",
acknowledgement = ack-nhfb,
annote = "A dialogue model is an abstract model that is used to
describe the structure of the dialogue between a user
and an interactive computer system. Dialogue models
form the basis of the notations that are used in user
interface management systems (UIMS). In this paper
three classes of dialogue models are investigated.
These classes are transition networks, grammars, and
events. Formal definitions of all three models are
presented, along with algorithms for converting the
notations into an executable form. It is shown that the
event model has the greatest descriptive power.
Efficient algorithms for converting from the transition
diagram and grammar models to the event model are
presented. The implications of these results for the
design and implementation of UIMSs are also
discussed.",
keywords = "algorithms; automata; computation by abstract devices;
computer graphics; design; dialogue models; human
factors; human-computer interaction; languages;
methodology and techniques; models of computation;
software engineering; theory; tools and techniques;
user interface management; user interfaces",
subject = "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
Techniques, User interfaces. {\bf F.1.1}: Theory of
Computation, COMPUTATION BY ABSTRACT DEVICES, Models of
Computation, Automata. {\bf I.3.6}: Computing
Methodologies, COMPUTER GRAPHICS, Methodology and
Techniques, Interaction techniques.",
}
@Article{Anonymous:1986:IA,
author = "Anonymous",
title = "Information for Authors",
journal = j-TOG,
volume = "5",
number = "3",
pages = "276--278",
month = jul,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 17:06:48 1996",
acknowledgement = ack-nhfb,
}
@Article{Foley:1986:GEIc,
author = "James Foley",
title = "{Guest Editor}'s Introduction: Special Issue on User
Interface Software",
journal = j-TOG,
volume = "5",
number = "4",
pages = "279--282",
month = oct,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 17:04:13 1996",
bibsource = "Graphics/siggraph/86.bib",
acknowledgement = ack-nhfb,
}
@Article{Jacob:1986:SLD,
author = "Robert J. K. Jacob",
title = "A Specification Language for Direct-Manipulation User
Interfaces",
journal = j-TOG,
volume = "5",
number = "4",
pages = "283--317",
month = oct,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 13 17:25:58 MDT 1994",
bibsource = "Graphics/siggraph/86.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/27624.html",
acknowledgement = ack-nhfb,
keywords = "design; direct manipulation; human factors; languages;
logics and meanings of programs; models and principles;
software engineering; specification language;
specification techniques; specifying and verifying and
reasoning about programs; state transition diagram;
tools and techniques; user interfaces; user-interface
management system (UIMS); user/machine systems",
review = "ACM CR 8804-0266",
subject = "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
Techniques, User interfaces. {\bf H.1.2}: Information
Systems, MODELS AND PRINCIPLES, User/Machine Systems,
Human factors. {\bf F.3.1}: Theory of Computation,
LOGICS AND MEANINGS OF PROGRAMS, Specifying and
Verifying and Reasoning about Programs, Specification
techniques. {\bf D.2.1}: Software, SOFTWARE
ENGINEERING, Requirements/Specifications, Languages.",
}
@Article{Olsen:1986:MMI,
author = "Dan R. {Olsen, Jr.}",
title = "{MIKE}: The Menu Interaction Kontrol Environment",
journal = j-TOG,
volume = "5",
number = "4",
pages = "318--344",
month = oct,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:49:36 1994",
bibsource = "Graphics/siggraph/86.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/28868.html",
acknowledgement = ack-nhfb,
annote = "A User Interface Management System (UIMS) called MIKE
that does not use the syntactic specifications found in
most UIMSs is described. Instead, MIKE provides a
default syntax that is automatically generated from the
definition of the semantic commands that the
interaction is to support. The default syntax is
refined using an interface editor that allows
modification of the presentation of the interface. It
is shown how active pictures can be created by adding
action expressions to the viewports of MIKE's windowing
system. The implications of MIKE's command-based
dialogue description are discussed in terms of
extensible interfaces, device and dialogue-style
independence, and system support functions.",
keywords = "computer graphics; design; dialogue design tools;
human factors; human-computer interfaces; interaction
techniques; methodologies; methodology and techniques;
miscellaneous; rapid prototyping; software engineering;
UIMS; user interface management systems",
review = "ACM CR 8803-0183",
subject = "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
Techniques, User interfaces. {\bf D.2.m}: Software,
SOFTWARE ENGINEERING, Miscellaneous, Rapid prototyping.
{\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques, Interaction
techniques. {\bf H.1.2}: Information Systems, MODELS
AND PRINCIPLES, User/Machine Systems, Human factors.
{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
Techniques, MIKE. {\bf D.2.10}: Software, SOFTWARE
ENGINEERING, Design, Methodologies.",
}
@Article{Borning:1986:CTB,
author = "Alan Borning and Robert Duisberg",
title = "Constraint-Based Tools for Building User Interfaces",
journal = j-TOG,
volume = "5",
number = "4",
pages = "345--374",
month = oct,
year = "1986",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:38:23 1994",
bibsource = "Graphics/siggraph/86.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/29354.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; animation; computer graphics; consistency
of multiple views; constraint satisfaction;
constraints; graphical programming; language
classifications; languages; methodology and techniques;
miscellaneous; nonprocedural languages; object-oriented
programming; programming languages; rapid prototyping;
software engineering; temporal constraints; tools and
techniques; user interfaces; user-interface management
systems",
subject = "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
Techniques, User interfaces. {\bf D.2.m}: Software,
SOFTWARE ENGINEERING, Miscellaneous, Rapid prototyping.
{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
Classifications, Nonprocedural languages. {\bf I.3.6}:
Computing Methodologies, COMPUTER GRAPHICS, Methodology
and Techniques, Languages. {\bf I.3.7}: Computing
Methodologies, COMPUTER GRAPHICS, Three-Dimensional
Graphics and Realism, Animation.",
}
@Article{Foley:1987:WBS,
author = "Thomas A. Foley",
title = "Weighted Bicubic Spline Interpolation to Rapidly
Varying Data",
journal = j-TOG,
volume = "6",
number = "1",
pages = "1--18",
month = jan,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 09:07:21 1994",
bibsource = "Graphics/imager/imager.87.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/27626.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; bivariate interpolation; computer-aided
design",
review = "ACM CR 8803-0220",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Spline and piecewise polynomial
interpolation.",
}
@Article{McKenna:1987:WOH,
author = "Michael McKenna",
title = "Worst-case optimal hidden-surface removal",
journal = j-TOG,
volume = "6",
number = "1",
pages = "19--28",
month = jan,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:58:09 1994",
bibsource = "Graphics/siggraph/87.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/27627.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; arrangements of lines; complexity theory;
computer graphics; design; design of algorithms;
geometric complexity; hidden line/surface elimination;
hidden-line removal; performance; plane-sweep; theory;
topological sweep; verification; visibility; visibility
algorithm; visibility polyhedron",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Visible line/surface algorithms. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Computations on discrete structures. {\bf I.3.5}:
Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems.",
}
@Article{Nasri:1987:PSM,
author = "Ahmad H. Nasri",
title = "Polyhedral subdivision methods for free-form
surfaces",
journal = j-TOG,
volume = "6",
number = "1",
pages = "29--73",
month = jan,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:59:23 1994",
bibsource = "Graphics/imager/imager.87.bib,
Graphics/siggraph/85.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/27628.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; B-spline; design; polyhedral subdivision",
review = "ACM CR 8802-0120",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.3.3}: Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation, Display algorithms. {\bf
F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems.",
}
@Article{Ressler:1987:IGT,
author = "Sanford Ressler",
title = "The Incrementor: a Graphical Technique for
Manipulating Parameters",
journal = j-TOG,
volume = "6",
number = "1",
pages = "74--78",
month = jan,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/87.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/214381.html",
annote = "To visually organize a set of variables and to change
the values of those variables.",
keywords = "design; human factors",
subject = "{\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques, Interaction
techniques. {\bf H.5.2}: Information Systems,
INFORMATION INTERFACES AND PRESENTATION, User
Interfaces, Input devices and strategies. {\bf H.5.2}:
Information Systems, INFORMATION INTERFACES AND
PRESENTATION, User Interfaces, Interaction styles.",
}
@Article{Patterson:1987:CTP,
author = "Richard R. Patterson",
title = "Corrigendum: ``{Projective Transformations of the
Parameter of a {Bernstein}-{B{\'e}zier} Curve}''",
journal = j-TOG,
volume = "6",
number = "1",
pages = "79--79",
month = jan,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 17:10:41 1996",
note = "See \cite{Patterson:1985:PTP}.",
acknowledgement = ack-nhfb,
}
@Article{Cohen:1987:NLB,
author = "Elaine Cohen",
title = "A new local basis for designing with tensioned
splines",
journal = j-TOG,
volume = "6",
number = "2",
pages = "81--122",
month = apr,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 02:22:05 1994",
bibsource = "Graphics/imager/imager.87.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/31337.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; B-splines; beta-splines; CAGD; convex hull
property; geometric continuity; knot insertion;
nu-splines; theory; variation diminishing property;
visual continuity",
review = "ACM CR 8807-0544",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling.
{\bf G.1.1}: Mathematics of Computing, NUMERICAL
ANALYSIS, Interpolation, Spline and piecewise
polynomial interpolation.",
}
@Article{Schwarz:1987:ECR,
author = "Michael W. Schwarz and William B. Cowan and John C.
Beatty",
title = "An Experimental Comparison of {RGB}, {YIQ}, {LAB},
{HSV}, and Opponent Color Models",
journal = j-TOG,
volume = "6",
number = "2",
pages = "123--158",
month = apr,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:00:43 1994",
bibsource = "Graphics/imager/imager.87.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/31338.html",
acknowledgement = ack-nhfb,
keywords = "color matching; colour; experimentation; human
factors",
review = "ACM CR 8808-0634",
subject = "{\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques, Ergonomics. {\bf
I.3.6}: Computing Methodologies, COMPUTER GRAPHICS,
Methodology and Techniques, Interaction techniques.
{\bf I.3.1}: Computing Methodologies, COMPUTER
GRAPHICS, Hardware architecture, Raster display
devices.",
}
@Article{Hill:1987:ADR,
author = "Ralph D. Hill",
title = "Adaptive {2-D} Rotation Control",
journal = j-TOG,
volume = "6",
number = "2",
pages = "159--161",
month = apr,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:53:59 1994",
bibsource = "Graphics/siggraph/87.bib",
annote = "To rotate objects rapidly and precisely to multiples
of 90 degrees, yet allow accurate selection of
arbitrary rotations.",
}
@Article{Robertson:1987:CAS,
author = "Philip K. Robertson and John F. O'Callaghan",
title = "Corrigenda: ``{The Application of Scene Synthesis
Techniques to the Display of Multidimensional Image
Data}''",
journal = j-TOG,
volume = "6",
number = "2",
pages = "162--162",
month = apr,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 13:13:04 1996",
note = "See \cite{Robertson:1985:ASS}.",
acknowledgement = ack-nhfb,
}
@Article{Fournier:1987:GEI,
author = "A. Fournier and W. T. Reeves",
title = "{Guest Editors}' Introduction",
journal = j-TOG,
volume = "6",
number = "3",
pages = "165--166",
month = jul,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/87.bib",
}
@Article{Lewis:1987:GSS,
author = "J. P. Lewis",
title = "Generalized Stochastic Subdivision",
journal = j-TOG,
volume = "6",
number = "3",
pages = "167--190",
month = jul,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:56:51 1994",
bibsource = "Graphics/imager/imager.87.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/35069.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; color; fractals; modeling of natural
phenomena; shading; shadowing; stochastic
interpolation; stochastic models; texture synthesis;
waves",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation. {\bf I.3.7}:
Computing Methodologies, COMPUTER GRAPHICS,
Three-Dimensional Graphics and Realism, Color, shading,
shadowing, and texture. {\bf G.3}: Mathematics of
Computing, PROBABILITY AND STATISTICS, Probabilistic
algorithms (including Monte Carlo).",
}
@Article{Tso:1987:MRW,
author = "Pauline Y. Ts'o and Brian A. Barsky",
title = "Modeling and Rendering Waves: Wave-Tracing Using
Beta-Splines and Reflective and Refractive Texture
Mapping",
journal = j-TOG,
volume = "6",
number = "3",
pages = "191--214",
month = jul,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:01:29 1994",
bibsource = "Graphics/imager/imager.87.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/35070.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; Fresnel; hydrodynamics; wave
refraction; waves",
review = "ACM CR 8809-0721",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation. {\bf I.3.7}:
Computing Methodologies, COMPUTER GRAPHICS,
Three-Dimensional Graphics and Realism.",
}
@Article{Klassen:1987:MEA,
author = "R. Victor Klassen",
title = "Modeling the Effect of the Atmosphere on Light",
journal = j-TOG,
volume = "6",
number = "3",
pages = "215--237",
month = jul,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:55:32 1994",
bibsource = "Graphics/imager/imager.87.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/35071.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; fog; image synthesis; lighting
interaction; model atmosphere; natural sky simulation;
scattering; theory",
review = "ACM CR 8807-0543",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation. {\bf I.3.7}:
Computing Methodologies, COMPUTER GRAPHICS,
Three-Dimensional Graphics and Realism.",
}
@Article{Bronsvoort:1987:CTG,
author = "Willem F. Bronsvoort and Fopke Klok",
title = "Corrigendum: ``{Ray Tracing Generalized Cylinders}''",
journal = j-TOG,
volume = "6",
number = "3",
pages = "238--239",
month = jul,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 17:15:30 1996",
note = "See \cite{Bronsvoort:1985:RTG}.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/214383.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; human factors; theory",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling.
{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD).",
}
@Article{Anonymous:1987:IA,
author = "Anonymous",
title = "Information for Authors",
journal = j-TOG,
volume = "6",
number = "3",
pages = "240--242",
month = jul,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 17:17:45 1996",
acknowledgement = ack-nhfb,
}
@Article{Knuth:1987:DHD,
author = "Donald E. Knuth",
title = "Digital Halftones by Dot Diffusion",
journal = j-TOG,
volume = "6",
number = "4",
pages = "245--273",
month = oct,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Mon Feb 05 13:22:59 1996",
bibsource = "Graphics/imager/imager.87.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/35040.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; bilevel display; constrained average; edge
enhancement; error diffusion; facsimiles;
Floyd-Steinberg method; minimized average error; Mona
Lisa; ordered dither; parallel computing; printing",
review = "ACM CR 8808-0633",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.4.1}: Computing Methodologies, IMAGE PROCESSING,
Digitization, Quantization. {\bf I.4.3}: Computing
Methodologies, IMAGE PROCESSING, Enhancement, Grayscale
manipulation.",
}
@Article{Miller:1987:GAN,
author = "James R. Miller",
title = "Geometric Approaches to Nonplanar Quadric Surface
Intersection Curves",
journal = j-TOG,
volume = "6",
number = "4",
pages = "274--307",
month = oct,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:58:48 1994",
bibsource = "Graphics/imager/imager.87.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/35041.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; boundary evaluation; performance;
reliability; solid modeling",
review = "ACM CR 8807-0545",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems. {\bf J.6}: Computer
Applications, COMPUTER-AIDED ENGINEERING,
Computer-aided design (CAD).",
}
@Article{Kamada:1987:ETH,
author = "Tomihisa Kamada and Satoru Kawai",
title = "An enhanced treatment of hidden lines",
journal = j-TOG,
volume = "6",
number = "4",
pages = "308--323",
month = oct,
year = "1987",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Thu Aug 25 23:54:50 1994",
bibsource = "Graphics/imager/imager.87.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/35042.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; attribute binding; dotted hidden lines;
hidden line/surface removal; viewing transformation",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Viewing algorithms.
{\bf I.3.4}: Computing Methodologies, COMPUTER
GRAPHICS, Graphics Utilities, Graphics packages. {\bf
I.3.7}: Computing Methodologies, COMPUTER GRAPHICS,
Three-Dimensional Graphics and Realism, Visible
line/surface algorithms.",
}
@Article{DeRose:1988:GCS,
author = "Tony D. DeRose and Brian A. Barsky",
title = "Geometric Continuity, Shape Parameters, and Geometric
Constructions for {Catmull}-{Rom} Splines",
journal = j-TOG,
volume = "7",
number = "1",
pages = "1--41",
month = jan,
year = "1988",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:06:05 1994",
bibsource = "Graphics/imager/imager.88.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/42265.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; approximation; B-spline; B{\'e}zier
curves; computer-aided geometric design; curves and
surfaces; design",
review = "ACM CR 8811-0884",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD). {\bf G.1.1}:
Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Spline and piecewise polynomial
interpolation. {\bf F.2.2}: Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Nonnumerical Algorithms and Problems, Geometrical
problems and computations. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Geometric algorithms,
languages, and systems.",
}
@Article{DeFloriani:1988:HBM,
author = "Leila De Floriani and Bianca Falcidieno",
title = "A hierarchical boundary model for solid object
representation",
journal = j-TOG,
volume = "7",
number = "1",
pages = "42--60",
month = jan,
year = "1988",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 13 17:25:58 MDT 1994",
bibsource = "Graphics/imager/imager.88.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/46164.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; hierarchical data structures;
solid modeling boundary representation; tree graphs",
review = "ACM CR 8903-0165",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD).",
}
@Article{Veenstra:1988:LDO,
author = "Jack Veenstra and Narendra Ahuja",
title = "Line drawings of octree-represented objects",
journal = j-TOG,
volume = "7",
number = "1",
pages = "61--75",
month = jan,
year = "1988",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:11:13 1994",
bibsource = "Graphics/imager/imager.88.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/42189.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; hidden line removal; three-dimensional
representation",
review = "ACM CR 8810-0807",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation.",
}
@Article{Bleser:1988:CSR,
author = "Teresa W. Bleser and John L. Sibert and J. Patrick
McGee",
title = "Charcoal Sketching: Returning Control to the Artist",
journal = j-TOG,
volume = "7",
number = "1",
pages = "76--81",
month = jan,
year = "1988",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:02:54 1994",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/42230.html",
acknowledgement = ack-nhfb,
keywords = "design; drawing; human factors",
review = "ACM CR 8902-0091",
subject = "{\bf J.5}: Computer Applications, ARTS AND HUMANITIES,
Arts, fine and performing. {\bf B.4.2}: Hardware,
INPUT/OUTPUT AND DATA COMMUNICATIONS, Input/Output
Devices.",
}
@Article{Ball:1988:CTP,
author = "A. A. Ball and D. J. T. Storry",
title = "Conditions for Tangent Plane Continuity Over
Recursively Generated {B}-Spline Surfaces",
journal = j-TOG,
volume = "7",
number = "2",
pages = "83--102",
month = apr,
year = "1988",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:02:06 1994",
bibsource = "Graphics/imager/imager.88.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/42459.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; discrete Fourier transform;
nonrectangular topologies; recursive subdivision;
theory",
subject = "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
ANALYSIS, Interpolation, Smoothing. {\bf G.1.1}:
Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Spline and piecewise polynomial
interpolation. {\bf G.1.3}: Mathematics of Computing,
NUMERICAL ANALYSIS, Numerical Linear Algebra,
Eigenvalues. {\bf I.3.5}: Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Geometric algorithms, languages, and systems.
{\bf J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD).",
}
@Article{Fournier:1988:PFB,
author = "Alain Fournier and Donald Fussell",
title = "On the Power of the Frame Buffer",
journal = j-TOG,
volume = "7",
number = "2",
pages = "103--128",
month = apr,
year = "1988",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 13 17:25:58 MDT 1994",
bibsource = "Graphics/imager/imager.88.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/42460.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; complexity; shadow; visibility",
review = "ACM CR 8902-0088",
subject = "{\bf I.3.1}: Computing Methodologies, COMPUTER
GRAPHICS, Hardware architecture, Raster display
devices. {\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling.
{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Color, shading, shadowing, and texture. {\bf I.3.7}:
Computing Methodologies, COMPUTER GRAPHICS,
Three-Dimensional Graphics and Realism, Visible
line/surface algorithms.",
}
@Article{Zyda:1988:DAC,
author = "Michael J. Zyda",
title = "A Decomposable Algorithm for Contour Surface Display
Generation",
journal = j-TOG,
volume = "7",
number = "2",
pages = "129--148",
month = apr,
year = "1988",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:12:34 1994",
bibsource = "Graphics/imager/imager.88.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/42461.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; contour surface display generation;
contouring; contouring tree",
review = "ACM CR 8811-0883",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling.
{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Visible line/surface algorithms.",
}
@Article{Gaudet:1988:MEH,
author = "Severin Gaudet and Richard Hobson and Pradeep Chilka
and Thomas Calvert",
title = "Multiprocessor Experiments for High Speed Ray
Tracing",
journal = j-TOG,
volume = "7",
number = "3",
pages = "151--179",
month = jul,
year = "1988",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 13 17:25:58 MDT 1994",
bibsource = "Graphics/imager/imager.88.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/44480.html",
acknowledgement = ack-nhfb,
annote = "Good review of previous work. They classify space into
shells (bounding volumes), starting from the parent
shell (the scene) to the leaf nodes (primitives). They
divide processing into three major tasks which are easy
to schedule and pipeline, and then define a processor
called a PERT (Pipelined Engine for Ray Tracing) which
can support these tasks and work either separately or
in parallel. A powerful, flexible system. \\ New
single- and multiprocessor models for ray tracing are
presented. Important features are (1) the use of custom
VLSI building blocks, (2) the use of a modified
hierarchical data-structure-based ray tracing algorithm
with three disjoint data sets, and (3) scene access
through adaptive information broadcasting. A modular
design is presented that permits incremental
performance enhancement up to two orders of magnitude
over conventional minicomputers or workstations. Ray
tracing is a surprisingly good application for a shared
bus architecture because of the computational
complexity of intersecting light rays with graphics
objects.",
keywords = "adaptive broadcasting; algorithms; bounding volume;
design; hardware; parallel processing; VLSI systems
design",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Color, shading, shadowing, and texture. {\bf C.1.2}:
Computer Systems Organization, PROCESSOR ARCHITECTURES,
Multiple Data Stream Architectures (Multiprocessors),
Parallel processors. {\bf C.1.2}: Computer Systems
Organization, PROCESSOR ARCHITECTURES, Multiple Data
Stream Architectures (Multiprocessors), Pipeline
processors. {\bf C.3}: Computer Systems Organization,
SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS,
Microprocessor/microcomputer applications. {\bf I.3.3}:
Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation, Display algorithms. {\bf
I.3.7}: Computing Methodologies, COMPUTER GRAPHICS,
Three-Dimensional Graphics and Realism, Animation.",
}
@Article{Duce:1988:FSS,
author = "D. A. Duce and E. V. C. Fielding and L. S. Marshall",
title = "Formal Specification of a Small Example Based on
{GKS}",
journal = j-TOG,
volume = "7",
number = "3",
pages = "180--197",
month = jul,
year = "1988",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 13 17:25:58 MDT 1994",
bibsource = "Graphics/imager/imager.88.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/44481.html",
acknowledgement = ack-nhfb,
keywords = "abstract data type; bundled attributes; constructive
specification; design; implicit regeneration; standard;
standardization; verification",
review = "ACM CR 8904-0267",
subject = "{\bf I.3.4}: Computing Methodologies, COMPUTER
GRAPHICS, Graphics Utilities. {\bf I.3.4}: Computing
Methodologies, COMPUTER GRAPHICS, Graphics Utilities,
GKS. {\bf D.2.1}: Software, SOFTWARE ENGINEERING,
Requirements/Specifications. {\bf F.3.1}: Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS,
Specifying and Verifying and Reasoning about Programs,
Specification techniques.",
}
@Article{DeRose:1988:CBS,
author = "Tony D. DeRose",
title = "Composing {B{\'e}zier} simplexes",
journal = j-TOG,
volume = "7",
number = "3",
pages = "198--221",
month = jul,
year = "1988",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:05:15 1994",
bibsource = "Graphics/imager/imager.88.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/44482.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; B{\'e}zier curves; computer-aided
geometric design; free-form deformations; geometric
continuity; triangular B{\'e}zier surface patches",
subject = "I.3.5 Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Curve,
surface, solid, and object representations \\ J.6
Computer Applications, COMPUTER-AIDED ENGINEERING,
Computer-aided design (CAD)",
}
@Article{Anonymous:1988:IA,
author = "Anonymous",
title = "Information for Authors",
journal = j-TOG,
volume = "7",
number = "3",
pages = "222--224",
month = jul,
year = "1988",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 17:19:55 1996",
acknowledgement = ack-nhfb,
}
@Article{Olsen:1988:CST,
author = "Dan Olsen",
title = "Call for Submissions to the {TOG} Interactive
Techniques Notebook",
journal = j-TOG,
volume = "7",
number = "4",
pages = "227--228",
month = oct,
year = "1988",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/88.bib",
}
@Article{Beatty:1988:VAT,
author = "John C. Beatty",
title = "A Video Adjunct to {\em Transactions on Graphics}",
journal = j-TOG,
volume = "7",
number = "4",
pages = "229--230",
month = oct,
year = "1988",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 17:22:18 1996",
bibsource = "Graphics/siggraph/88.bib",
acknowledgement = ack-nhfb,
}
@Article{Westmore:1988:WGF,
author = "Richard J. Westmore",
title = "A Window-Based Graphics Frame Store Architecture",
journal = j-TOG,
volume = "7",
number = "4",
pages = "233--248",
month = oct,
year = "1988",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:11:56 1994",
bibsource = "Graphics/imager/imager.88.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/46166.html",
acknowledgement = ack-nhfb,
keywords = "2D graphics; bit-mapped frame stores; design; VLSI;
window graphics; WSI",
review = "ACM CR 8903-0163",
subject = "{\bf I.3.1}: Computing Methodologies, COMPUTER
GRAPHICS, Hardware architecture, Raster display
devices. {\bf C.1.3}: Computer Systems Organization,
PROCESSOR ARCHITECTURES, Other Architecture Styles,
Cellular architecture. {\bf C.5.4}: Computer Systems
Organization, COMPUTER SYSTEM IMPLEMENTATION, VLSI
Systems. {\bf B.4.2}: Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, Input/Output Devices, Image display.
{\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques, Interaction
techniques.",
}
@Article{Stone:1988:CGM,
author = "Maureen C. Stone and William B. Cowan and John C.
Beatty",
title = "Color Gamut Mapping and the Printing of Digital Color
Images",
journal = j-TOG,
volume = "7",
number = "4",
pages = "249--292",
month = oct,
year = "1988",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:10:33 1994",
bibsource = "Graphics/imager/imager.88.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/48045.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; color; color correction; color printing;
color reproduction; experimentation",
review = "ACM CR 8906-0410",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Color, shading, shadowing, and texture. {\bf I.3.4}:
Computing Methodologies, COMPUTER GRAPHICS, Graphics
Utilities. {\bf I.4.3}: Computing Methodologies, IMAGE
PROCESSING, Enhancement. {\bf I.4.1}: Computing
Methodologies, IMAGE PROCESSING, Digitization.",
}
@Article{Posch:1989:CA,
author = "K. C. Posch and W. D. Fellner",
title = "The Circle-Brush Algorithm",
journal = j-TOG,
volume = "8",
number = "1",
pages = "1--24",
month = jan,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 13 17:25:58 MDT 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/49156.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; brushing; design; performance; raster
graphics",
review = "ACM CR 8907-0500",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.1}: Computing Methodologies, COMPUTER
GRAPHICS, Hardware architecture, Raster display
devices.",
}
@Article{Middleditch:1989:IAL,
author = "A. E. Middleditch and T. W. Stacey and S. B. Tor",
title = "Intersection Algorithms for Lines and Circles",
journal = j-TOG,
volume = "8",
number = "1",
pages = "25--40",
month = jan,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:48:55 1996",
bibsource = "Graphics/imager/imager.89.bib",
note = "See corrigenda \cite{Baker:1994:CAL}.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/49157.html",
acknowledgement = ack-nhfb,
keywords = "circle intersection; computation errors; computational
geometry; computer-aided drawing; line intersection;
measurement",
review = "ACM CR 8909-0683",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD).",
}
@Article{Cheng:1989:PBS,
author = "Fuhua Cheng and Ardeshir Goshtasby",
title = "A Parallel {B}-spline Surface Fitting Algorithm",
journal = j-TOG,
volume = "8",
number = "1",
pages = "41--50",
month = jan,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:13:43 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/214377.html",
annote = "Support different surface types. Because surface
fitting appears to be a O(nm) problem, attacking the
problem in parallel can make B-splines more
supportable. See also [Yang 87], [Schnieder 87].",
keywords = "cyclic reduction; interpolation; recursive doubling;
uniform cubic B-spline",
subject = "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
ANALYSIS, Interpolation, Spline and piecewise
polynomial interpolation. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Geometric algorithms,
languages, and systems.",
}
@Article{Rossignac:1989:AZC,
author = "Jaroslaw R. Rossignac and Herbert B. Voelcker",
title = "Active Zones in {CSG} for Accelerating Boundary
Evaluation, Redundancy Elimination, Interference
Detection, and Shading Algorithms",
journal = j-TOG,
volume = "8",
number = "1",
pages = "51--87",
month = jan,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:24:40 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/51123.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; boolean algebra; boundary evaluation;
design; performance; representation simplification;
solid modeling; theory",
review = "ACM CR 8909-0665 8909-0664",
subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Geometrical problems and
computations. {\bf B.6.3}: Hardware, LOGIC DESIGN,
Design Aids, Optimization. {\bf G.2.2}: Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.
{\bf I.1.1}: Computing Methodologies, ALGEBRAIC
MANIPULATION, Expressions and Their Representation,
Simplification of expressions. {\bf I.3.3}: Computing
Methodologies, COMPUTER GRAPHICS, Picture/Image
Generation, Display algorithms. {\bf I.3.7}: Computing
Methodologies, COMPUTER GRAPHICS, Three-Dimensional
Graphics and Realism, Color, shading, shadowing, and
texture. {\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Visible line/surface algorithms. {\bf J.6}: Computer
Applications, COMPUTER-AIDED ENGINEERING,
Computer-aided design (CAD).",
}
@Article{Farin:1989:CCO,
author = "Gerald Farin",
title = "Curvature continuity and offsets for piecewise
conics",
journal = j-TOG,
volume = "8",
number = "2",
pages = "89--99",
month = apr,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:15:15 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/62056.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; conic sections; design; offset curves;
rational B{\'e}zier curves",
review = "ACM CR 9005-0426",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Spline and piecewise polynomial
interpolation. {\bf J.7}: Computer Applications,
COMPUTERS IN OTHER SYSTEMS, Publishing. {\bf I.7.2}:
Computing Methodologies, TEXT PROCESSING, Document
Preparation.",
}
@Article{Joe:1989:MRC,
author = "Barry Joe",
title = "Multiple-knot and rational cubic beta-splines",
journal = j-TOG,
volume = "8",
number = "2",
pages = "100--120",
month = apr,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 13 17:25:58 MDT 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/62055.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; computer-aided geometric design; geometric
continuity; rational curves and surfaces",
review = "ACM CR 8910-0754",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Spline and piecewise polynomial
interpolation.",
}
@Article{Mallet:1989:DSI,
author = "Jean-Laurent Mallet",
title = "Discrete smooth interpolation",
journal = j-TOG,
volume = "8",
number = "2",
pages = "121--144",
month = apr,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 13 17:25:58 MDT 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/62057.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; grid; splines; theory",
review = "ACM CR 8908-0560",
subject = "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
ANALYSIS, Interpolation, Interpolation formulas. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Smoothing. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Curve, surface, solid,
and object representations.",
}
@Article{Bartels:1989:GEIa,
author = "Richard H. Bartels and Ronald N. Goldman",
title = "{Guest Editors}' Introduction: Special Issue on
Computer-Aided Geometric Design",
journal = j-TOG,
volume = "8",
number = "3",
pages = "145--146",
month = jul,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/89.bib",
}
@Article{Stone:1989:GCP,
author = "Maureen C. Stone and Tony D. DeRose",
title = "A geometric characterization of parametric cubic
curves",
journal = j-TOG,
volume = "8",
number = "3",
pages = "147--163",
month = jul,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 13 17:25:58 MDT 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77056.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; B{\'e}zier curves; design; spline curves",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Spline and piecewise polynomial
interpolation.",
}
@Article{Filip:1989:BPS,
author = "Daniel J. Filip",
title = "Blending Parametric Surfaces",
journal = j-TOG,
volume = "8",
number = "3",
pages = "164--173",
month = jul,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 13 17:25:58 MDT 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77057.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; computer-aided geometric design; geometric
continuity; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Spline and piecewise polynomial
interpolation.",
}
@Article{Farouki:1989:APD,
author = "R. T. Farouki and C. A. Neff and M. A. O'Connor",
title = "Automatic Parsing of Degenerate Quadric-Surface
Intersections",
journal = j-TOG,
volume = "8",
number = "3",
pages = "174--203",
month = jul,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Wed Sep 07 12:33:14 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77058.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; degenerate intersections; discriminant;
multivariate polynomial factorization; projecting cone;
quadric surfaces; rational parameterizations; Segre
characteristic; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.1.2}: Computing Methodologies, ALGEBRAIC
MANIPULATION, Algorithms, Algebraic algorithms.",
}
@Article{Loop:1989:MGB,
author = "Charles T. Loop and Tony D. DeRose",
title = "A multisided generalization of {B{\'e}zier} surfaces",
journal = j-TOG,
volume = "8",
number = "3",
pages = "204--234",
month = jul,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:19:31 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77059.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; computer-aided geometric design; design;
tensor product B{\'e}zier surfaces; theory; triangular
B{\'e}zier surface patches",
review = "ACM CR 9007-0610",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING.",
}
@Article{Peters:1989:LGH,
author = "Jorg Peters",
title = "Local Generalized {Hermite} Interpolation by Quartic
{$C^2$} Space Curves",
journal = j-TOG,
volume = "8",
number = "3",
pages = "235--242",
month = jul,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:21:42 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77060.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; C2 space curves; geometric smoothness;
intersection of osculating planes; local interpolation
scheme; theory",
subject = "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
ANALYSIS, Interpolation, Spline and piecewise
polynomial interpolation. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Curve, surface, solid,
and object representations.",
}
@Article{Prautzsch:1989:RTB,
author = "Hartmut Prautzsch",
title = "A Round Trip to {B}-Splines Via {De Casteljau}",
journal = j-TOG,
volume = "8",
number = "3",
pages = "243--254",
month = jul,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:23:17 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77061.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; B-spline control points; B{\'e}zier
curves; B{\'e}zier points; De Casteljau's construction;
differentiating; knot insertion; recurrence relation;
theory",
review = "ACM CR 9007-0596",
subject = "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
ANALYSIS, Interpolation, Spline and piecewise
polynomial interpolation. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Curve, surface, solid,
and object representations. {\bf G.1.2}: Mathematics of
Computing, NUMERICAL ANALYSIS, Approximation.",
}
@Article{Anonymous:1989:IA,
author = "Anonymous",
title = "Information for Authors",
journal = j-TOG,
volume = "8",
number = "3",
pages = "255--257",
month = jul,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:51:22 1996",
acknowledgement = ack-nhfb,
}
@Article{Bartels:1989:GEIb,
author = "Richard H. Bartels and Ronald N. Goldman",
title = "{Guest Editors}' Introduction",
journal = j-TOG,
volume = "8",
number = "4",
pages = "261--261",
month = oct,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/89.bib",
}
@Article{Warren:1989:BAS,
author = "J. Warren",
title = "Blending algebraic surfaces",
journal = j-TOG,
volume = "8",
number = "4",
pages = "263--278",
month = oct,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 09:07:27 1994",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77270.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; geometric continuity; ideals;
theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Interpolation formulas. {\bf G.1.1}:
Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Smoothing. {\bf G.1.2}: Mathematics of
Computing, NUMERICAL ANALYSIS, Approximation. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD).",
}
@Article{Rockwood:1989:DMI,
author = "A. P. Rockwood",
title = "The Displacement Method for Implicit Blending Surfaces
in Solid Models",
journal = j-TOG,
volume = "8",
number = "4",
pages = "279--297",
month = oct,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 13 17:25:58 MDT 1994",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77271.html",
acknowledgement = ack-nhfb,
keywords = "algebraic distance; design; geometric modeling;
implicit surfaces; sculptured surfaces; solid modeling;
theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.6.3}: Computing Methodologies, SIMULATION AND
MODELING, Applications.",
}
@Article{Chuang:1989:LIA,
author = "J. H. Chuang and C. M. Hoffmann",
title = "On local implicit approximation and its applications",
journal = j-TOG,
volume = "8",
number = "4",
pages = "298--324",
month = oct,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:14:15 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77272.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; curve/surface approximation; design;
implicitization; linear systems; resultant
computations; substitution; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
Approximation, Spline and piecewise polynomial
approximation. {\bf G.1.2}: Mathematics of Computing,
NUMERICAL ANALYSIS, Approximation, Linear
approximation. {\bf G.1.3}: Mathematics of Computing,
NUMERICAL ANALYSIS, Numerical Linear Algebra, Linear
systems (direct and iterative methods).",
}
@Article{Abhyankar:1989:APR,
author = "Shreeram S. Abhyankar and Chanderjit J. Bajaj",
title = "Automatic parameterization of rational curves and
surfaces {IV}: algebraic space curves",
journal = j-TOG,
volume = "8",
number = "4",
pages = "325--334",
month = oct,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:13:12 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77273.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; computer-aided design; design; parametric
curves; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems. {\bf F.2.1}: Theory
of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computations on polynomials. {\bf I.1.2}: Computing
Methodologies, ALGEBRAIC MANIPULATION, Algorithms. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Smoothing. {\bf G.1.1}: Mathematics of
Computing, NUMERICAL ANALYSIS, Interpolation, Spline
and piecewise polynomial interpolation. {\bf J.6}:
Computer Applications, COMPUTER-AIDED ENGINEERING,
Computer-aided design (CAD).",
}
@Article{Hohmeyer:1989:RCP,
author = "M. E. Hohmeyer and B. A. Barsky",
title = "Rational continuity: parametric, geometric, and
{Frenet} frame continuity of rational curves",
journal = j-TOG,
volume = "8",
number = "4",
pages = "335--359",
month = oct,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:17:47 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77274.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; B-splines; beta-constraints; beta-splines;
B{\'e}zier curves; computer-aided geometric design;
continuity; design; geometric continuity; jet spaces;
NURBs; parametric continuity; rational B-splines;
rational splines; reparameterization; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Spline and piecewise polynomial
interpolation. {\bf J.6}: Computer Applications,
COMPUTER-AIDED ENGINEERING, Computer-aided design
(CAD). {\bf G.1.1}: Mathematics of Computing, NUMERICAL
ANALYSIS, Interpolation, Smoothing.",
}
@Article{Said:1989:GBC,
author = "H. B. Said",
title = "A Generalized Ball Curve and its Recursive Algorithm",
journal = j-TOG,
volume = "8",
number = "4",
pages = "360--371",
month = oct,
year = "1989",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 13 17:25:58 MDT 1994",
bibsource = "Graphics/imager/imager.89.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77275.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; Bernstein polynomials; B{\'e}zier curves;
computer-aided geometric design; curves and surfaces;
design; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems. {\bf J.6}: Computer
Applications, COMPUTER-AIDED ENGINEERING,
Computer-aided design (CAD). {\bf F.2.1}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computations on polynomials.",
}
@Article{Rushmeier:1990:ERM,
author = "Holly E. Rushmeier and Kenneth E. Torrance",
title = "Extending the Radiosity Method to Include Specularly
Reflecting and Translucent Materials",
journal = j-TOG,
volume = "9",
number = "1",
pages = "1--27",
month = jan,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77636.html",
acknowledgement = ack-nhfb,
annote = "An extension to the radiosity method is presented that
rigorously accounts for the presence of a small number
of specularly reflecting surfaces in an otherwise
diffuse scene, and for the presence of a small number
of specular or ideal diffuse transmitter. The
relationship between the extended method and earlier
radiosity and ray-tracing methods is outlined. It is
shown that all three methods are based on the same
general equation of radiative transfer. A simple
superposition of the earlier radiosity and ray-tracing
methods in order to account for specular behavior is
shown to be physically inconsistent, as the methods are
based on different assumptions. Specular behavior is
correctly included in the present method. The extended
radiosity method and example images are presented.",
keywords = "backward form factor; forward form factor; global
illumination; image synthesis; radiosity; ray tracing",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation. {\bf I.3.7}:
Computing Methodologies, COMPUTER GRAPHICS,
Three-Dimensional Graphics and Realism.",
}
@Article{Nicholl:1990:PGT,
author = "Robin A. Nicholl and Tina M. Nicholl",
title = "Performing Geometric Transformations by Program
Transformation",
journal = j-TOG,
volume = "9",
number = "1",
pages = "28--40",
month = jan,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77637.html",
acknowledgement = ack-nhfb,
keywords = "geometric algorithms; geometric transformation;
program equivalences; program transformation",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Hierarchy and geometric transformations. {\bf I.3.5}:
Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Curve,
surface, solid, and object representations. {\bf
D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
Techniques.",
}
@Article{Joe:1990:KIB,
author = "Barry Joe",
title = "Knot Insertion for Beta-Spline Curves and Surfaces",
journal = j-TOG,
volume = "9",
number = "1",
pages = "41--65",
month = jan,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77638.html",
acknowledgement = ack-nhfb,
keywords = "B-splines; beta-splines; computer-aided geometric
design; discrete B-splines; discrete beta-splines;
geometric continuity; knot refinement; subdivision",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Spline and piecewise polynomial
interpolation.",
}
@Article{Edelsbrunner:1990:SST,
author = "Herbert Edelsbrunner and Ernst Peter Mucke",
title = "Simulation of Simplicity: {A} Technique to Cope with
Degenerate Cases in Geometric Algorithms",
journal = j-TOG,
volume = "9",
number = "1",
pages = "66--104",
month = jan,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77639.html",
acknowledgement = ack-nhfb,
keywords = "computational geometry; degenerate data; determinants;
implementation; perturbation; programming tool;
symbolic computation",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems. {\bf
F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Geometrical problems and computations. {\bf
F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sorting and searching. {\bf G.4}: Mathematics
of Computing, MATHEMATICAL SOFTWARE, Reliability and
robustness.",
}
@Article{Day:1990:IAF,
author = "A. M. Day",
title = "The Implementation of an Algorithm to Find the Convex
Hull of a Set of Three-Dimensional Points",
journal = j-TOG,
volume = "9",
number = "1",
pages = "105--132",
month = jan,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:40:34 1996",
bibsource = "Graphics/imager/imager.90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77640.html",
acknowledgement = ack-nhfb,
keywords = "convex hull; divide and conquer; edge structure;
implementation; tetrahedron; triangulation",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Curve,
surface, solid, and object representations. {\bf E.1}:
Data, DATA STRUCTURES.",
}
@Article{Henry:1990:MI,
author = "Tyson R. Henry and Scott E. Hudson",
title = "Multidimensional Icons",
journal = j-TOG,
volume = "9",
number = "1",
pages = "133--137",
month = jan,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77641.html",
acknowledgement = ack-nhfb,
keywords = "design",
subject = "{\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques, Interaction
techniques. {\bf D.2.2}: Software, SOFTWARE
ENGINEERING, Tools and Techniques, User interfaces.
{\bf D.2.6}: Software, SOFTWARE ENGINEERING,
Programming Environments, Interactive.",
}
@Article{Glassner:1990:TDV,
author = "Andrew S. Glassner",
title = "A Two-Dimensional View Controller",
journal = j-TOG,
volume = "9",
number = "1",
pages = "138--141",
month = jan,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/imager/imager.90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/77642.html",
keywords = "design; human factors",
subject = "{\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques, Interaction
techniques. {\bf K.8}: Computing Milieux, PERSONAL
COMPUTING. {\bf I.3.3}: Computing Methodologies,
COMPUTER GRAPHICS, Picture/Image Generation.",
}
@Article{Anonymous:1990:FCA,
author = "Anonymous",
title = "Five-Year Cumulative Author Index",
journal = j-TOG,
volume = "9",
number = "1",
pages = "142--144",
month = jan,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 17:30:09 1996",
acknowledgement = ack-nhfb,
}
@Article{Bartels:1990:GEI,
author = "Richard H. Bartels and Ronald N. Goldman",
title = "{Guest Editors}' Introduction",
journal = j-TOG,
volume = "9",
number = "2",
pages = "145--146",
month = apr,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/90.bib",
acknowledgement = ack-nhfb,
}
@Article{Abhyankar:1990:IIA,
author = "Shreeram S. Abhyankar and Srinivasan Chandrasekar and
Vijaya Chandru",
title = "Improper Intersection of Algebraic Curves",
journal = j-TOG,
volume = "9",
number = "2",
pages = "147--159",
month = apr,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78957.html",
acknowledgement = ack-nhfb,
annote = "Special issue on Computer-Aided design --- Part III",
keywords = "algebraic geometry; Bezout's theorem; curve
intersections; space curves",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD).",
}
@Article{Dyn:1990:BSS,
author = "Nira Dyn and David Levin and John A. Gregory",
title = "A Butterfly Subdivision Scheme for Surface
Interpolation with Tension Control",
journal = j-TOG,
volume = "9",
number = "2",
pages = "160--169",
month = apr,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78958.html",
acknowledgement = ack-nhfb,
annote = "Special issue on Computer-Aided design --- Part III",
keywords = "general triangulation; subdivision scheme; surface
interpolation; tension control",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation. {\bf J.6}: Computer Applications,
COMPUTER-AIDED ENGINEERING, Computer-aided design
(CAD).",
}
@Article{Brunet:1990:SRO,
author = "Pere Brunet and Isabel Navazo",
title = "Solid Representation and Operation Using Extended
Octrees",
journal = j-TOG,
volume = "9",
number = "2",
pages = "170--197",
month = apr,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib,
Graphics/siggraph/90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78959.html",
acknowledgement = ack-nhfb,
annote = "Special issue on Computer-Aided design --- Part III",
keywords = "algorithms; computer-aided geometric design; design;
geometric modeling; octrees; solid modeling",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Modeling packages. {\bf I.3.7}: Computing
Methodologies, COMPUTER GRAPHICS, Three-Dimensional
Graphics and Realism, Visible line/surface algorithms.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Geometrical problems and computations.",
}
@Article{Lasser:1990:TRT,
author = "Dieter Lasser",
title = "Two Remarks on Tau-Splines",
journal = j-TOG,
volume = "9",
number = "2",
pages = "198--211",
month = apr,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78960.html",
acknowledgement = ack-nhfb,
annote = "Special issue on Computer-Aided design --- Part III",
keywords = "algorithms; B-spline curves; B{\'e}zier curves;
B{\'e}zier representations; convex hull property;
design; geometric continuity; nu-splines; positivity;
tau-splines; theory; variation-diminishing property",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Spline and piecewise polynomial
interpolation.",
}
@Article{Ferguson:1990:CSI,
author = "David R. Ferguson and Thomas A. Grandine",
title = "On the Construction of Surface Interpolating Curves:
{I}. {A} Method for Handling Nonconstant Parameter
Curves",
journal = j-TOG,
volume = "9",
number = "2",
pages = "212--225",
month = apr,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78961.html",
acknowledgement = ack-nhfb,
annote = "Special issue on Computer-Aided design --- Part III",
keywords = "algorithms; boolean sum surface; curve interpolation;
design; linear equations; nullspace; singular value
decomposition; tensor product spline",
subject = "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
ANALYSIS, Interpolation, Spline and piecewise
polynomial interpolation. {\bf G.1.3}: Mathematics of
Computing, NUMERICAL ANALYSIS, Numerical Linear
Algebra, Linear systems (direct and iterative methods).
{\bf J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD).",
}
@Article{Ware:1990:RCG,
author = "Colin Ware and William Cowan",
title = "The {RGYB} Color Geometry",
journal = j-TOG,
volume = "9",
number = "2",
pages = "226--232",
month = apr,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
note = "See corrigenda \cite{Ware:1991:CRC}.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78962.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Color, shading, shadowing, and texture. {\bf I.3.1}:
Computing Methodologies, COMPUTER GRAPHICS, Hardware
architecture, Raster display devices.",
}
@Article{Pavlidis:1990:RCS,
author = "Theo Pavlidis",
title = "Re: Comments on ``{Stochastic Sampling in Computer
Graphics}''",
journal = j-TOG,
volume = "9",
number = "2",
pages = "233--236",
month = apr,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
note = "See \cite{Cook:1986:SSC,Wold:1990:RCS}.",
acknowledgement = ack-nhfb,
}
@Article{Wold:1990:RCS,
author = "Erling Wold and Kim Pepard",
title = "Re: Comments on ``{Stochastic Sampling in Computer
Graphics}''",
journal = j-TOG,
volume = "9",
number = "2",
pages = "237--243",
month = apr,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Aug 26 00:36:55 1994",
bibsource = "Graphics/imager/imager.90.bib",
note = "See \cite{Cook:1986:SSC,Pavlidis:1990:RCS}.",
}
@Article{Anonymous:1990:C,
author = "Anonymous",
title = "Corrigendum",
journal = j-TOG,
volume = "9",
number = "2",
pages = "244--244",
month = apr,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 17:32:13 1996",
acknowledgement = ack-nhfb,
}
@Article{Levoy:1990:ERT,
author = "Marc Levoy",
title = "Efficient Ray Tracing of Volume Data",
journal = j-TOG,
volume = "9",
number = "3",
pages = "245--261",
month = jul,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78965.html",
acknowledgement = ack-nhfb,
annote = "{\em Volume Rendering} is a technique for visualizing
sampled scalar or vector fields of three spatial
dimensions without fitting geometric primitives to the
data. A subset of these techniques generates images by
computing 2-D projections of a colored semitransparent
volume, where the color and opacity at each point are
derived from the data using local operators. Since all
voxels participate in the generation of each image,
rendering time grows linearly with the size of the
dataset. This paper presents a front-to-back
image-order volume-rendering algorithm and discusses
two techniques for improving its performance. The first
technique employs a pyramid of binary volumes to encode
spatial coherence present in the data, and the second
technique uses an opacity threshold to adaptively
terminate ray tracing. Although the actual time saved
depends on the data, speedups of an order of magnitude
have been observed for datasets of useful size and
complexity. Examples from two applications are given:
medical imaging and molecular graphics.",
keywords = "algorithms; design; hierarchical spatial enumeration;
medical imaging; molecular graphics; octree;
performance; ray tracing; scientific visualization;
volume rendering; volume visualization; voxel",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.3.7}: Computing Methodologies, COMPUTER GRAPHICS,
Three-Dimensional Graphics and Realism, Visible
line/surface algorithms.",
}
@Article{Hobby:1990:RNC,
author = "John D. Hobby",
title = "Rasterization of Nonparametric Curves",
journal = j-TOG,
volume = "9",
number = "3",
pages = "262--277",
month = jul,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78966.html",
acknowledgement = ack-nhfb,
keywords = "algebraic curves; algorithms; rasterization; scan
conversion; theory",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems.",
}
@Article{Preparata:1990:CAV,
author = "Franco P. Preparata and Jeffrey Scott Vitter and
Mariette Yvinec",
title = "Computation of the Axial View of a Set of Isothetic
Parallelepipeds",
journal = j-TOG,
volume = "9",
number = "3",
pages = "278--300",
month = jul,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78967.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; amortized analysis; axial view;
computational geometry; contracted binary trees;
design; hidden line elimination; scene sensitive;
segment trees",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Visible line/surface algorithms.",
}
@Article{Joe:1990:QBS,
author = "Barry Joe",
title = "Quartic Beta-Splines",
journal = j-TOG,
volume = "9",
number = "3",
pages = "301--337",
month = jul,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78968.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; arc-length continuity; beta-splines;
computer-aided geometric design; design; discrete
beta-splines; geometric continuity; knot insertion;
rational curves; shape parameters",
subject = "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
ANALYSIS, Interpolation, Spline and piecewise
polynomial interpolation. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Curve, surface, solid,
and object representations.",
}
@Article{Guitard:1990:CSE,
author = "Richard Guitard and Colin Ware",
title = "A Color Sequence Editor",
journal = j-TOG,
volume = "9",
number = "3",
pages = "338--341",
month = jul,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1990:IA,
author = "Anonymous",
title = "Information for Authors",
journal = j-TOG,
volume = "9",
number = "3",
pages = "342--344",
month = jul,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:51:22 1996",
acknowledgement = ack-nhfb,
}
@Article{Lamming:1990:SMI,
author = "Michael G. Lamming and Warren L. Rhodes",
title = "A Simple Method for Improved Color Printing of Monitor
Images",
journal = j-TOG,
volume = "9",
number = "4",
pages = "345--375",
month = oct,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
note = "See corrigenda \cite{Lamming:1991:CSM}.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/88567.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; color printing; design; device independent
color; performance; video to print; WYSIWYG color",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation. {\bf I.3.4}:
Computing Methodologies, COMPUTER GRAPHICS, Graphics
Utilities.",
}
@Article{Rokne:1990:FLS,
author = "J. G. Rokne and Brian Wyvill and Xiaolin Wu",
title = "Fast Line Scan-Conversion",
journal = j-TOG,
volume = "9",
number = "4",
pages = "376--388",
month = oct,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/88572.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; incremental curve generation; line
generators",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display
algorithms.",
}
@Article{Dobkin:1990:CTP,
author = "David P. Dobkin and Silvio V. F. Levy and William P.
Thurston and Allan R. Wilks",
title = "Contour Tracing by Piecewise Linear Approximations",
journal = j-TOG,
volume = "9",
number = "4",
pages = "389--423",
month = oct,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/88575.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; contour tracing; Coxeter triangulations;
simplicial continuation; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems.",
}
@Article{Ball:1990:ICV,
author = "A. A. Ball and D. J. T. Storry",
title = "An Investigation of Curvature Variations Over
Recursively Generated {B}-Spline Surfaces",
journal = j-TOG,
volume = "9",
number = "4",
pages = "424--437",
month = oct,
year = "1990",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/90.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/88580.html",
abstract = "The continuity properties of recursively generated
B-spline surfaces over an arbitrary topology have been
related to the eigenproperties of the local subdivision
transformation, and conditions have been established on
the subdivision weightings for tangent plane continuity
at extraordinary points. In this paper, curves through
an extraordinary point, which align in both the tangent
and binormal direction, are identified, and their
curvatures are compared either side of the point.
Further restrictions on the subdivision weightings are
derived to optimize the curvature properties of the
surface. In general continuity of curvature is not
attained.",
acknowledgement = ack-nhfb,
keywords = "algorithms; B-splines surfaces; curvature continuity;
design; discrete Fourier transform; nonrectangular
topologies; recursive subdivision; theory",
subject = "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
ANALYSIS, Interpolation, Spline and piecewise
polynomial interpolation. {\bf G.1.3}: Mathematics of
Computing, NUMERICAL ANALYSIS, Numerical Linear
Algebra, Eigenvalues. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Geometric algorithms,
languages, and systems.",
}
@Article{Kamada:1991:GFV,
author = "Tomihisa Kamada and Satoru Kawai",
title = "A General Framework for Visualizing Abstract Objects
and Relations",
journal = j-TOG,
volume = "10",
number = "1",
pages = "1--39",
month = jan,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/91.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/99903.html",
abstract = "Pictorial representations significantly enhance our
ability to understand complicated relations and
structures, which means that information systems
strongly require user interfaces that support the
visualization of many kinds of information with a wide
variety of graphical forms. At present, however, these
difficult visualization problems have not been solved.
We present a visualization framework for translating
abstract objects and relations, typically represented
in textual forms, into pictorial representations, and
describe a general visualization interface based on
this framework. In our framework, abstract objects and
relations are mapped to graphical objects and relations
by user-defined mapping rules. The kernel of our
visualization process is to determine a layout of
graphical objects under geometric constraints. A
constraint-based object layout system named COOL has
been developed to handle this layout problem. COOL
introduces the concept of rigidity of constraints in
order to reasonably handle, a set of conflicting
constraints by use of the least squares method. As
applications of our system, we show the generation of
kinship diagrams, list diagrams, Nassi-Shneiderman
diagrams, and entity-relationship diagrams.",
acknowledgement = ack-nhfb,
keywords = "Algorithms; Computer graphics; Constraint-based
systems; Constraints; Design; Graph drawing; Graphics
systems; Graphics utilities; human factors; Languages;
Layouts; Methodology and techniques; Pictorial
representations; Picture description languages;
Software engineering; Theory; Tools and techniques;
User interfaces; Visualization",
subject = "{\bf I.3.4}: Computing Methodologies, COMPUTER
GRAPHICS, Graphics Utilities, Picture description
languages. {\bf H.5.2}: Information Systems,
INFORMATION INTERFACES AND PRESENTATION, User
Interfaces, Evaluation/methodology. {\bf D.2.2}:
Software, SOFTWARE ENGINEERING, Tools and Techniques,
User interfaces. {\bf H.1.2}: Information Systems,
MODELS AND PRINCIPLES, User/Machine Systems, Human
information processing.",
}
@Article{Jansen:1991:DOP,
author = "Frederik W. Jansen",
title = "Depth-Order Point Classification Techniques for {CSG}
Display Algorithms",
journal = j-TOG,
volume = "10",
number = "1",
pages = "40--70",
month = jan,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/ray.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/99904.html",
abstract = "Constructive Solid Geometry (CSG) defines objects as
Boolean combinations (CSG trees) of primitive solids.
To display such objects, one must classify points on
the surfaces of the primitive solids with respect to
the resulting composite object, to test whether these
points lie on the boundary of the composite object or
not. Although the point classification is trivial
compared to the surface classification (i.e., the
computation of the composite object), for CSG models
with a large number of primitive solids (large CSG
trees), the point classification may still consume a
considerable fraction of the total processing time.
This paper presents an overview of existing and new
efficiency-improving techniques for classifying points
in depth order. The different techniques are compared
through experiments.",
acknowledgement = ack-nhfb,
keywords = "algorithms; computational geometry; constructive solid
geometry; CSG; CSG algorithms; design; display
algorithms; efficiency; experimentation; object
modeling; realism; solid modeling",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling,
Constructive solid geometry (CSG).",
}
@Article{Karasick:1991:EDT,
author = "Michael Karasick and Derek Lieber and Lee R.
Nackman",
title = "Efficient {Delaunay} Triangulation Using Rational
Arithmetic",
journal = j-TOG,
volume = "10",
number = "1",
pages = "71--91",
month = jan,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jun 11 18:22:31 1999",
bibsource = "Graphics/imager/imager.91.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/99905.html",
abstract = "Many fundamental tests performed by geometric
algorithms can be formulated in terms of finding the
sign of a determinant. When these tests are implemented
using fixed precision arithmetic such as floating
point, they can produce incorrect answers; when they
are implemented using arbitrary-precision arithmetic,
they are expensive to compute. We present
adaptive-precision algorithms for finding the signs of
determinants of matrices with integer and rational
elements. These algorithms were developed and tested by
integrating them into the Guibas-Stolfi Delaunay
triangulation algorithm. Through a combination of
algorithm design and careful engineering of the
implementation, the resulting program can triangulate a
set of random rational points in the unit circle only
four to five times slower than can a floating-point
implementation of the algorithm. The algorithms,
engineering process, and software tools developed are
described.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; experimentation; languages;
performance; reliability; robust geometric computation;
triangulation",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD). {\bf G.4}:
Mathematics of Computing, MATHEMATICAL SOFTWARE,
Efficiency.",
}
@Article{Klassen:1991:DAC,
author = "R. Victor Klassen",
title = "Drawing Antialiased Cubic Spline Curves",
journal = j-TOG,
volume = "10",
number = "1",
pages = "92--108",
month = jan,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.91.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/99906.html",
abstract = "Cubic spline curves have many nice properties that
make them desirable for use in computer graphics, and
the advantages of antialiasing have been known for some
years. Yet, only recently has there been any attempt at
directly antialiasing spline curves. Parametric spline
curves have resisted antialiasing in several ways:
single segments may cross or become tangent to
themselves. Cusps and small loops are easily missed
entirely. Thus, short pieces of the curve cannot
necessarily be rendered in isolation. Finding the
distance from a pixel center to the curve accurately
and efficiently---usually an essential part of
antialiasing---is an unsolved problem. The method
presented by Lien, Shantz, and Pratt [21] is a good
start, although it considers pixel-length pieces of the
curve in isolation and lacks robustness in the handling
of certain curves. This paper provides an improved
method that is more robust, and is able to handle
intersections and tangency.",
acknowledgement = ack-nhfb,
annote = "figures 7 and 8 on p. 106 are transposed but not their
captions",
keywords = "adaptive forward differencing; algorithms;
antialiasing parametric curves; B{\'e}zier curves;
design; parametric curve plotting",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Splines.",
}
@Article{Lamming:1991:CSM,
author = "Michael G. Lamming and Warren L. Rhodes",
title = "Corrigenda: ``{A Simple Method for Improved Color
Printing of Monitor Images}''",
journal = j-TOG,
volume = "10",
number = "1",
pages = "109--109",
month = jan,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 17:34:26 1996",
note = "See \cite{Lamming:1990:SMI}.",
acknowledgement = ack-nhfb,
}
@Article{Casner:1991:TAA,
author = "Stephen M. Casner",
title = "A Task-Analytic Approach to the Automated Design of
Graphic Presentations",
journal = j-TOG,
volume = "10",
number = "2",
pages = "111--151",
month = apr,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:41:24 1996",
bibsource = "Graphics/siggraph/91.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108361.html",
abstract = "BOZ is an automated graphic design and presentation
tool that designs graphics based on an analysis of the
task for which a graphic is intended to support. When
designing a graphic, BOZ aims to optimize two ways in
which graphics help expedite human performance of
information-processing tasks: (1) allowing users to
substitute simple perceptual inferences in place of
more demanding logical inferences, and (2) streamlining
users' search for needed information. BOZ analyzes a
logical description of a task to be performed by a
human user and designs a provably equivalent perceptual
task by substituting perceptual inferences in place of
logical inferences in the task description. BOZ then
designs and renders an accompanying graphic that
encodes and structures data such that performance of
each perceptual inference is supported and visual
search is minimized. BOZ produces a graphic along with
a perceptual procedure describing how to use the
graphic to complete the task. A key feature of BOZ's
approach is that it is able to design different
presentations of the same information customized to the
requirements of different tasks. BOZ is used to design
graphic presentations of airline schedule information
to support five different airline reservation tasks.
Reaction time studies done with real users for one task
and graphic show that the BOZ-designed graphic
significantly reduces users' performance time to the
task. Regression analyses link the observed efficiency
savings to BOZ's two key design principles: perceptual
inference substitutions and pruning of visual search.",
acknowledgement = ack-nhfb,
keywords = "Algorithms; Applications and expert systems;
Artificial intelligence; Automated design; Computer
graphics; Design; Ergonomics; experimentation; Graphic
design; Graphic user interface; Human factors; Human
information processing; Methodology and techniques;
Models and principles; Software engineering; Task
analysis; Theory; Tools and techniques; User
interfaces; User/machine systems; Visual languages",
subject = "{\bf H.5.2}: Information Systems, INFORMATION
INTERFACES AND PRESENTATION, User Interfaces, Screen
design. {\bf H.5.2}: Information Systems, INFORMATION
INTERFACES AND PRESENTATION, User Interfaces,
Interaction styles. {\bf H.1.2}: Information Systems,
MODELS AND PRINCIPLES, User/Machine Systems, Human
information processing. {\bf D.2.2}: Software, SOFTWARE
ENGINEERING, Tools and Techniques, User interfaces.
{\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques, Ergonomics. {\bf
H.5.2}: Information Systems, INFORMATION INTERFACES AND
PRESENTATION, User Interfaces, Ergonomics.",
}
@Article{Klassen:1991:IFD,
author = "R. Victor Klassen",
title = "Integer Forward Differencing of Cubic Polynomials:
Analysis and Algorithms",
journal = j-TOG,
volume = "10",
number = "2",
pages = "152--181",
month = apr,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/91.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108364.html",
abstract = "Two incremental cubic interpolation algorithms are
derived and analysed. Each is based on a known linear
interpolation algorithm and modified for third order
forward differencing. The tradeoff between overflow
avoidance and loss of precision has made forward
differencing a method which, although known to be fast,
can be difficult to implement. It is shown that there
is one particular family of curves which represents the
worst case, in the sense that if a member of this
family can be accurately drawn without overflow, then
any curve which fits in the bounding box of that curve
can be. From this the limitations in terms of step
count and screen resolution are found for each of the
two algorithms.",
acknowledgement = ack-nhfb,
keywords = "algorithms; B{\'e}zier curves; parametric curve
plotting",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Splines. {\bf G.1.1}: Mathematics of Computing,
NUMERICAL ANALYSIS, Interpolation, Spline and piecewise
polynomial interpolation. {\bf G.1.2}: Mathematics of
Computing, NUMERICAL ANALYSIS, Approximation, Spline
and piecewise polynomial approximation. {\bf I.3.5}:
Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Curve,
surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems.",
}
@Article{Ekoule:1991:TAA,
author = "A. B. Ekoule and F. C. Peyrin and C. L. Odet",
title = "A Triangulation Algorithm From Arbitrary Shaped
Multiple Planar Contours",
journal = j-TOG,
volume = "10",
number = "2",
pages = "182--199",
month = apr,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:41:32 1996",
bibsource = "Graphics/siggraph/91.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108363.html",
abstract = "Conventional triangulation algorithms from planar
contours suffer from some limitations. For instance,
incorrect results can be obtained when the contours are
not convex, or when the contours in two successive
slices are very different. In the same way, the
presence of multiple contours in a slice leads to
ambiguities in defining the appropriate links. The
purpose of this paper is to define a general
triangulation procedure that provides a solution to
these problems. We first describe a simple heuristic
triangulation algorithm which is extended to nonconvex
contours. It uses an original decomposition of an
arbitrary contour into elementary convex subcontours.
Then the problem of linking one contour in a slice to
several contours in an adjacent slice is examined. To
this end, a new and unique interpolated contour is
generated between the two slices, and the link is
created using the previously defined procedure. Next, a
solution to the general case of linking multiple
contours in each slice is proposed. Finally, the
algorithm is applied to the reconstitution of the
external surface of a complex shaped object: a human
vertebra.",
acknowledgement = ack-nhfb,
keywords = "algorithms; slice interpolation; triangulation",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations.",
}
@Article{Becker:1991:IMT,
author = "Shawn C. Becker and William A. Barrett and Dan R.
{Olsen, Jr.}",
title = "Interactive measurement of three-dimensional objects
using a depth buffer and linear probe",
journal = j-TOG,
volume = "10",
number = "2",
pages = "201--207",
month = apr,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:41:43 1996",
bibsource = "Graphics/siggraph/91.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108446.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism. {\bf
I.3.6}: Computing Methodologies, COMPUTER GRAPHICS,
Methodology and Techniques, Interaction techniques.
{\bf J.2}: Computer Applications, PHYSICAL SCIENCES AND
ENGINEERING.",
}
@Article{Beatty:1991:ENE,
author = "John Beatty",
title = "Editorial: New {Editor-in-Chief}",
journal = j-TOG,
volume = "10",
number = "3",
pages = "209--210",
month = jul,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "Graphics/siggraph/91.bib",
}
@Article{Singh:1991:ALS,
author = "Gurminder Singh and Mark Green",
title = "Automating the Lexical and Syntactic Design of
Graphical User Interfaces: The {UofA}* {UIMS}",
journal = j-TOG,
volume = "10",
number = "3",
pages = "213--254",
month = jul,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:41:48 1996",
bibsource = "Graphics/siggraph/91.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108543.html",
acknowledgement = ack-nhfb,
keywords = "Computer graphics; design; human factors; Interaction
techniques; Methodologies; Methodology and techniques;
Miscellaneous; Rapid prototyping; Software engineering;
User interface design; User interface management
systems",
subject = "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
Techniques, User interfaces. {\bf H.5.2}: Information
Systems, INFORMATION INTERFACES AND PRESENTATION, User
Interfaces, User interface management systems (UIMS).
{\bf D.2.10}: Software, SOFTWARE ENGINEERING, Design,
Methodologies. {\bf H.5.2}: Information Systems,
INFORMATION INTERFACES AND PRESENTATION, User
Interfaces, Screen design. {\bf H.5.2}: Information
Systems, INFORMATION INTERFACES AND PRESENTATION, User
Interfaces, Interaction styles. {\bf I.3.6}: Computing
Methodologies, COMPUTER GRAPHICS, Methodology and
Techniques, Interaction techniques.",
}
@Article{Hobby:1991:NSI,
author = "John D. Hobby",
title = "Numerically Stable Implicitization of Cubic Curves",
journal = j-TOG,
volume = "10",
number = "3",
pages = "255--296",
month = jul,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/91.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108546.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; numerical stability; reliability",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations.",
}
@Article{Walton:1991:TPP,
author = "D. J. Walton and R. Xu",
title = "Turning Point Preserving Planar Interpolation",
journal = j-TOG,
volume = "10",
number = "3",
pages = "297--311",
month = jul,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.91.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108548.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; approximation; design; interpolation;
quadratic B{\'e}zier curves",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Splines. {\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
Approximation, Spline and piecewise polynomial
approximation. {\bf G.1.1}: Mathematics of Computing,
NUMERICAL ANALYSIS, Interpolation, Spline and piecewise
polynomial interpolation. {\bf J.6}: Computer
Applications, COMPUTER-AIDED ENGINEERING,
Computer-aided design (CAD).",
}
@Article{Meyer:1991:LTO,
author = "Alan Meyer",
title = "A Linear Time {Oslo} Algorithm",
journal = j-TOG,
volume = "10",
number = "3",
pages = "312--318",
month = jul,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.91.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/108552.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; B-splines; computer-aided geometric
design; design; subdivision",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Splines. {\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD).",
}
@Article{Ware:1991:CRC,
author = "Colin Ware and William Cowan",
title = "Corrigenda: ``{The {RGYB} Color Geometry}''",
journal = j-TOG,
volume = "10",
number = "3",
pages = "319--319",
month = jul,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 17:38:09 1996",
note = "See \cite{Ware:1990:RCG}.",
acknowledgement = ack-nhfb,
}
@Article{Foley:1991:ELB,
author = "Jim Foley",
title = "Editorial: Looking Back, Looking Ahead",
journal = j-TOG,
volume = "10",
number = "4",
pages = "321--322",
month = oct,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/91.bib",
acknowledgement = ack-nhfb,
}
@Article{Rappoport:1991:RCS,
author = "Ari Rappoport",
title = "Rendering Curves and Surfaces with Hybrid Subdivision
and Forward Differencing",
journal = j-TOG,
volume = "10",
number = "4",
pages = "323--341",
month = oct,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.91.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/116914.html",
acknowledgement = ack-nhfb,
keywords = "adaptive forward differencing; algorithms; B{\'e}zier
curves and surfaces; design; parametric curves and
surfaces; performance; subdivision method; theory",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations.",
}
@Article{Lee:1991:CSP,
author = "S. L. Lee and A. A. Majid",
title = "Closed Smooth Piecewise Bicubic Surfaces",
journal = j-TOG,
volume = "10",
number = "4",
pages = "342--365",
month = oct,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/91.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/116915.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; B-splines; B{\'e}zier representation;
bicubic patches; closed surfaces; de Casteljau
algorithm; design; geometric continuity; geometric
modeling; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Spline and piecewise polynomial
interpolation. {\bf G.1.3}: Mathematics of Computing,
NUMERICAL ANALYSIS, Numerical Linear Algebra,
Eigenvalues. {\bf I.3.5}: Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Splines.",
}
@Article{Pottmann:1991:LCC,
author = "Helmut Pottmann",
title = "Locally controllable conic splines with curvature
continuity",
journal = j-TOG,
volume = "10",
number = "4",
pages = "366--377",
month = oct,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/imager/imager.91.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/116916.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; conic sections; design; geometric
continuity; projective geometry; rational B{\'e}zier
curves",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING. {\bf I.3.5}: Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Splines.",
}
@Article{Chionh:1991:UMR,
author = "Eng-Wee Chionh and Ronald N. Goldman and James R.
Miller",
title = "Using Multivariate Resultants to Find the Intersection
of Three Quadric Surfaces",
journal = j-TOG,
volume = "10",
number = "4",
pages = "378--400",
month = oct,
year = "1991",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 16:06:06 1996",
bibsource = "Graphics/siggraph/91.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/116917.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD). {\bf I.3.5}:
Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Curve,
surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems. {\bf I.3.5}:
Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Physically
based modeling.",
}
@Article{Sharir:1992:SOS,
author = "Micha Sharir and Mark H. Overmars",
title = "A Simple Output-Sensitive Algorithm for Hidden Surface
Removal",
journal = j-TOG,
volume = "11",
number = "1",
pages = "1--11",
month = jan,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/112141.html",
abstract = "We derive a simple output-sensitive algorithm for
hidden surface removal in a collection of n triangles
in space for which a (partial) depth order is known. If
$k$ is the combinatorial complexity of the output
visibility map, the method runs in time $O(n\sqrt{k}
\log n)$. The method is extended to work for other
classes of objects as well, sometimes with even
improved time bounds. For example, we obtain an
algorithm that performs hidden surface removal for n
(nonintersecting) balls in time $O(n^{3/2}\log n+k)$",
acknowledgement = ack-nhfb,
keywords = "algorithms; hidden surface removal; theory",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Hidden line/surface removal. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Geometrical problems and computations. {\bf I.3.5}:
Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems.",
}
@Article{Cameron:1992:RMG,
author = "Stephen Cameron and Yap Chee-Keng",
title = "Refinement Methods for Geometric Bounds in
Constructive Solid Geometry",
journal = j-TOG,
volume = "11",
number = "1",
pages = "12--39",
month = jan,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/123764.html",
abstract = "In constructive solid geometry, geometric solids are
represented as trees whose leaves are labeled by
primitive solids and whose internal nodes are labeled
by set-theoretic operations. A {\em bounding function}
in this context is an upper or lower estimate on the
extent of the constituent sets; such bounds are
commonly used to speed up algorithms based on such
trees. We introduce the class of {\em totally
consistent bounding functions}, which have the
desirable properties of allowing surprisingly good
bounds to be built quickly. Both outer and inner bounds
can be refined using a set of rewrite rules, for which
we give some complexity and convergence results. We
have implemented the refinement rules for outer bounds
within a solid modeling system, where they have proved
especially useful for intersection testing in three and
four dimensions. Our implementations have used boxes as
bounds, but different classes (shapes) of bounds are
also explored. The rewrite rules are also applicable to
relatively slow, exact operations, which we explore for
their theoretical insight, and to general Boolean
algebras. Results concerning the relationship between
these bounds and active zones are also noted.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; performance; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Hierarchy and geometric transformations. {\bf F.2.2}:
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Computations on discrete structures. {\bf
F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Geometrical problems and computations. {\bf
I.1.1}: Computing Methodologies, ALGEBRAIC
MANIPULATION, Expressions and Their Representation,
Simplification of expressions. {\bf J.6}: Computer
Applications, COMPUTER-AIDED ENGINEERING,
Computer-aided design (CAD).",
}
@Article{Desaulniers:1992:EMB,
author = "H. Desaulniers and N. F. Stewart",
title = "An Extension of Manifold Boundary Representations to
the $r$-Sets",
journal = j-TOG,
volume = "11",
number = "1",
pages = "40--60",
month = jan,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/111777.html",
abstract = "In this paper we study the relationship between {\em
manifold solids} (r-sets whose boundaries are
two-dimensional closed manifolds) and {\em r-sets}. We
begin by showing that an r-set may be viewed as the
limit of a certain sequence of manifold solids, where
distance is measured using the Hausdorff metric. This
permits us to introduce a minimal set of generalized
Euler operators, sufficient for the construction and
manipulation of r-sets. The completeness result for
ordinary Euler operators carries over immediately to
the generalized Euler operators on the r-sets and the
modification of the usual boundary data structures,
corresponding to our extension to nonmanifold r-sets,
is straightforward. We in fact describe a modification
of a well-known boundary data structure in order to
illustrate how the extension can be used in typical
solid modeling algorithms, and describe an
implementation.\par
The results described above largely eliminate what has
been called an inherent mismatch between the modeling
spaces defined by manifold solids and by r-sets. We
view the r-sets as a more appropriate choice for a
modeling space: in particular, the r-sets provide
closure with respect to regularized set operations and
a complete set of generalized Euler operators for the
manipulation of boundary representations, for graphics
and other purposes. It remains to formulate and prove a
theorem on the soundness of the generalized Euler
operators.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Boundary representations.",
}
@Article{Bajaj:1992:ASD,
author = "Chanderjit L. Bajaj and Insung Ihm",
title = "Algebraic Surface Design with {Hermite}
Interpolation",
journal = j-TOG,
volume = "11",
number = "1",
pages = "61--91",
month = jan,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/120081.html",
abstract = "This paper presents an efficient algorithm called
Hermite interpolation, for constructing low-degree
algebraic surfaces, which contain, with $C^1$ or
tangent plane continuity, any given collection of
points and algebraic space curves having derivative
information. Positional as well as derivative
constraints on an implicitly defined algebraic surface
are translated into a homogeneous linear system, where
the unknowns are the coefficients of the polynomial
defining the algebraic surface. Computational details
of the Hermite interpolation algorithm are presented
along with several illustrative applications of the
interpolation technique to construction of joining or
blending surfaces for solid models as well as fleshing
surfaces for curved wire frame models. A heuristic
approach to interactive shape control of implicit
algebraic surfaces is also given, and open problems in
algebraic surface design are discussed.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on polynomials. {\bf G.1.1}:
Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Interpolation formulas.",
}
@Article{Shneiderman:1992:TVT,
author = "Ben Shneiderman",
title = "Tree Visualization with Tree-Maps: {A} {2-D}
Space-Filling Approach",
journal = j-TOG,
volume = "11",
number = "1",
pages = "92--99",
month = jan,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/115768.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; human factors",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
E.1}: Data, DATA STRUCTURES, Trees.",
}
@Article{Anonymous:1992:AI,
author = "Anonymous",
title = "Author Index",
journal = j-TOG,
volume = "11",
number = "1",
pages = "100--101",
month = jan,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 6 16:37:06 1996",
acknowledgement = ack-nhfb,
}
@Article{Williams:1992:VOM,
author = "Peter L. Williams",
title = "Visibility Ordering Meshed Polyhedra",
journal = j-TOG,
volume = "11",
number = "2",
pages = "103--126",
month = apr,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130899.html",
abstract = "A visibility-ordering of a set of objects from some
viewpoint is an ordering such that if object $a$
obstructs object $b$, then $b$ precedes $a$ in the
ordering. An algorithm is presented that generates a
visibility-ordering of an acyclic convex set of meshed
convex polyhedra. This algorithm takes time linear in
the size of the mesh. Modifications to this algorithm
and/or preprocessing techniques are described that
permit nonconvex cells nonconvex meshes (meshes with
cavities and/or voids), meshes with cycles, and sets of
disconnected meshes to be ordered. Visibility-ordering
of polyhedra is applicable to scientific visualization,
particularly direct volume rendering. It is shown how
the ordering algorithms can be used for domain
decomposition of finite element meshes for parallel
processing, and how the data structures used by these
algorithms can be used to solve the spatial point
location problem. The effects of cyclically obstructing
polyhedra are discussed and methods for their
elimination are described, including the use of the
Delaunay triangulation. Methods for converting
nonconvex meshes into convex meshes are described.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Visible line/surface algorithms. {\bf I.3.3}: Computing
Methodologies, COMPUTER GRAPHICS, Picture/Image
Generation, Display algorithms. {\bf I.3.3}: Computing
Methodologies, COMPUTER GRAPHICS, Picture/Image
Generation, Viewing algorithms. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Curve, surface, solid,
and object representations.",
}
@Article{Warren:1992:CMR,
author = "Joe Warren",
title = "Creating Multisided Rational {B}{\'e}zier Surfaces
Using Base Points",
journal = j-TOG,
volume = "11",
number = "2",
pages = "127--139",
month = apr,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130828.html",
abstract = "Rational B{\'e}zier surfaces provide an effective tool
for geometric design. One aspect of the theory of
rational surfaces that is not well understood is what
happens when a rational parameterization takes on the
value (0/0, 0/0, 0/0) for some parameter value. Such
parameter values are called base points of the
parameterization. Base points can be introduced into a
rational parameterization in B{\'e}zier form by setting
weights of appropriate control points to zero. By
judiciously introducing base points, one can create
parameterizations of four-, five- and six-sided surface
patches using rational B{\'e}zier surfaces defined over
triangular domains. Subdivision techniques allow
rendering and smooth meshing of such surfaces.
Properties of base points also lead to a new
understanding of incompatible edge twist methods such
as Gregory's patch.",
acknowledgement = ack-nhfb,
keywords = "design; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Interpolation formulas.",
}
@Article{Cheng:1992:ESD,
author = "Fuhua Cheng",
title = "Estimating Subdivision Depths for Rational Curves and
Surfaces",
journal = j-TOG,
volume = "11",
number = "2",
pages = "140--151",
month = apr,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130829.html",
abstract = "An algorithm to estimate subdivision depths for
rational curves and surfaces is presented. The
subdivision depth is not estimated for the given
curve/surface directly. The algorithm computes a
subdivision depth for the polynomial curve/surface of
which the given rational curve/surface is the image
under the standard perspective projection. This
subdivision depth, however, guarantees the required
flatness of the given curve/surface after the
subdivision. This work has applications in surface
rendering, surface/surface intersection, and mesh
generation.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems. {\bf J.6}: Computer
Applications, COMPUTER-AIDED ENGINEERING,
Computer-aided design (CAD).",
}
@Article{Hansen:1992:AGN,
author = "Allan Hansen and Farhad Arbab",
title = "An Algorithm for Generating {NC} Tools Paths for
Arbitrarily Shaped Pockets with Islands",
journal = j-TOG,
volume = "11",
number = "2",
pages = "152--182",
month = apr,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130832.html",
abstract = "In this paper we describe algorithms for generating NC
tool paths for machining of arbitrarily shaped 2 l/2
dimensional pockets with arbitrary islands. These
pocketing algorithms are based on a new offsetting
algorithm presented in this paper. Our offsetting
algorithm avoids costly two-dimensional Boolean set
operations, relatively expensive distance calculations,
and the overhead of extraneous geometry, such as the
Voronoi diagrams, used in other pocketing algorithms.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD). {\bf F.1.2}:
Theory of Computation, COMPUTATION BY ABSTRACT DEVICES,
Modes of Computation.",
}
@Article{Rokne:1992:DIL,
author = "J. Rokne and Y. Yao",
title = "Double-Step Incremental Linear Interpolation",
journal = j-TOG,
volume = "11",
number = "2",
pages = "183--192",
month = apr,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
note = "See \cite{Rokne:1993:C}.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130833.html",
abstract = "A two-step incremental linear interpolation algorithm
is derived and analyzed. It is shown that the algorithm
is correct, that it is reversible, and that it is
faster than previous single-step algorithms. An example
is given of the execution of the algorithm.",
acknowledgement = ack-nhfb,
keywords = "algorithms; performance",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf G.1.0}: Mathematics of Computing, NUMERICAL
ANALYSIS, General, Error analysis.",
}
@Article{Hudson:1992:ASC,
author = "Scott E. Hudson",
title = "Adding Shadows to a {3D} Cursor",
journal = j-TOG,
volume = "11",
number = "2",
pages = "193--199",
month = apr,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
acknowledgement = ack-nhfb,
}
@Article{Wilhelms:1992:OFI,
author = "Jane Wilhelms and Allen Van Gelder",
title = "Octrees for Faster Isosurface Generation",
journal = j-TOG,
volume = "11",
number = "3",
pages = "201--227",
month = jul,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130882.html",
abstract = "The large size of many volume data sets often prevents
visualization algorithms from providing interactive
rendering. The use of hierarchical data structures can
ameliorate this problem by storing summary information
to prevent useless exploration of regions of little or
no {\em current} interest within the volume. This paper
discusses research into the use of the {\em octree}
hierarchical data structure when the regions of current
interest can vary during the application, and are not
known {\em a priori}. Octrees are well suited to the
six-sided cell structure of many volumes.\par
A new space-efficient design is introduced for octree
representations of volumes whose resolutions are not
conveniently a power of two; octrees following this
design are called {\em branch-on-need octrees} (BONOs).
Also, a caching method is described that essentially
passes information between octree neighbors whose
visitation times may be quite different, then discards
it when its useful life is over.\par
Using the application of octrees to isosurface
generation as a focus, space and time comparisons for
octree-based versus more traditional ``marching''
methods are presented.",
acknowledgement = ack-nhfb,
keywords = "algorithms; performance",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Visible line/surface algorithms. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Curve, surface, solid,
and object representations. {\bf E.1}: Data, DATA
STRUCTURES, Trees. {\bf I.3.3}: Computing
Methodologies, COMPUTER GRAPHICS, Picture/Image
Generation, Display algorithms.",
}
@Article{Meyers:1992:SC,
author = "David Meyers and Shelley Skinner and Kenneth Sloan",
title = "Surfaces from Contours",
journal = j-TOG,
volume = "11",
number = "3",
pages = "228--258",
month = jul,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/131213.html",
abstract = "This paper is concerned with the problem of
reconstructing the surfaces of three-dimensional
objects, given a collection of planar contours
representing cross-sections through the objects. This
problem has important applications in biomedical
research and instruction, solid modeling, and
industrial inspection.\par
The method we describe produces a triangulated mesh
from the data points of the contours which is then used
in conjunction with a piecewise parametric
surface-fitting algorithm to produce a reconstructed
surface.\par
The problem can be broken into four subproblems: the
{\em correspondence problem} (which contours should be
connected by the surface?), the {\em tiling problem}
(how should the contours be connected?), the {\em
branching problem} (what do we do when there are
branches in the surface?), and the {\em surface-fitting
problem} (what is the precise geometry of the
reconstructed surface?) We describe our system for
surface reconstruction from sets of contours with
respect to each of these subproblems. Special attention
is given to the correspondence and branching problems.
We present a method that can handle sets of contours in
which adjacent contours share a very contorted
boundary, and we describe a new approach to solving the
correspondence problem using a Minimum Spanning Tree
generated from the contours.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Boundary
representations. {\bf I.3.5}: Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Geometric algorithms, languages, and systems.
{\bf I.3.8}: Computing Methodologies, COMPUTER
GRAPHICS, Applications.",
}
@Article{McIlroy:1992:GRE,
author = "M. Douglas McIlroy",
title = "Getting Raster Ellipses Right",
journal = j-TOG,
volume = "11",
number = "3",
pages = "259--275",
month = jul,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130892.html",
abstract = "A concise, incremental algorithm for raster
approximations to ellipses in standard position
produces approximations that are good to the last pixel
even near octant boundaries or the thin ends of highly
eccentric ellipses. The resulting approximations
commute with reflection about the diagonal and are
mathematically specifiable without reference to details
of the algorithm.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Line and curve
generation.",
}
@Article{Maillot:1992:NFM,
author = "Patrick-Gilles Maillot",
title = "A New, Fast Method for {2-D} Polygon Clipping:
Analysis and Software Implementation",
journal = j-TOG,
volume = "11",
number = "3",
pages = "276--290",
month = jul,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/130894.html",
abstract = "This paper presents a new 2D polygon clipping method,
based on an extension to the Sutherland-Cohen 2D line
clipping method. After discussing three basic polygon
clipping algorithms, a different approach is proposed,
explaining the principles of a new algorithm and
presenting it step by step.\par
An example implementation of the algorithm is given
along with some results. A comparison between the
proposed method, the Liang and Barsky algorithm, and
the Sutherland-Hodgman algorithm is also given, showing
performances up to eight times the speed of the
Sutherland-Hodgman algorithm, and up to three times the
Liang and Barsky algorithm. The algorithm proposed here
can use floating point or integer operations; this can
be useful for fast or simple implementations.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.4}: Computing Methodologies, COMPUTER
GRAPHICS, Graphics Utilities, Graphics packages. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems.",
}
@Article{Olsen:1992:BES,
author = "Dan R. Olsen",
title = "Bookmarks: An Enhanced Scroll Bar",
journal = j-TOG,
volume = "11",
number = "3",
pages = "291--295",
month = jul,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
acknowledgement = ack-nhfb,
}
@Article{Foley:1992:E,
author = "Jim Foley",
title = "Editorial",
journal = j-TOG,
volume = "11",
number = "4",
pages = "297--298",
month = oct,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1992:CP,
author = "Anonymous",
title = "Call for papers",
journal = j-TOG,
volume = "11",
number = "4",
pages = "299--299",
month = oct,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:52:54 1996",
acknowledgement = ack-nhfb,
}
@Article{Stone:1992:SIC,
author = "Maureen C. Stone",
title = "Special Issue on Color",
journal = j-TOG,
volume = "11",
number = "4",
pages = "300--304",
month = oct,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
acknowledgement = ack-nhfb,
}
@Article{Haase:1992:MPM,
author = "Chet S. Haase and Gary W. Meyer",
title = "Modeling Pigmented Materials for Realistic Image
Synthesis",
journal = j-TOG,
volume = "11",
number = "4",
pages = "305--335",
month = oct,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/146452.html",
abstract = "This article discusses and applies the Kubelka-Munk
theory of pigment mixing to computer graphics in order
to facilitate improved image synthesis. The theories of
additive and subtractive color mixing are discussed and
are shown to be insufficient for pigmented materials.
The Kubelka-Munk theory of pigment mixing is developed
and the relevant equations are derived. Pigment mixing
experiments are performed and the results are displayed
on color television monitors. A paint program that uses
Kubelka-Munk theory to mix real pigments is presented.
Theories of color matching with pigments are extended
to determine reflectances for use in realistic image
synthesis.",
acknowledgement = ack-nhfb,
keywords = "algorithms; experimentation; human factors",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Color, shading, shadowing, and texture. {\bf I.3.4}:
Computing Methodologies, COMPUTER GRAPHICS, Graphics
Utilities, Paint systems.",
}
@Article{MacIntyre:1992:PAC,
author = "Blair MacIntyre and William B. Cowan",
title = "A Practical Approach to Calculating Luminance Contrast
on a {CRT}",
journal = j-TOG,
volume = "11",
number = "4",
pages = "336--347",
month = oct,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/146467.html",
abstract = "Luminance contrast is the basis of text legibility,
and maintaining luminance contrast is essential for any
color selection algorithm. In principle, it can be
calculated precisely on a sufficiently well-calibrated
display surface, but calibration is very expensive.
Consequently, most current systems deal with contrast
using heuristics. However, the usual CRT setup puts the
display surface into a state that is relatively
predictable. Luminance values can be estimated based on
this state, and these luminance values have been used
to calculate contrast using the Michelson definition.
This paper proposes a method for determining the
contrast of colored areas displayed on a CRT. It uses a
contrast metric that is in wide use in visual
psychophysics and shows that the metric can be
approximated reasonably without display measurement, as
long as it is possible to assume that the CRT has been
adjusted according to usual CRT setup standards.",
acknowledgement = ack-nhfb,
keywords = "algorithms; human factors",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf B.4.2}: Hardware, INPUT/OUTPUT AND DATA
COMMUNICATIONS, Input/Output Devices, Image display.
{\bf H.5.2}: Information Systems, INFORMATION
INTERFACES AND PRESENTATION, User Interfaces, Screen
design.",
}
@Article{Wu:1992:CQD,
author = "Xialin Wu",
title = "Color Quantization by Dynamic Programming and
Principal Analysis",
journal = j-TOG,
volume = "11",
number = "4",
pages = "348--372",
month = oct,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/146475.html",
abstract = "Color quantization is a process of choosing a set of
$K$ representative colors to approximate the $N$ colors
of an image, $K < N$, such that the resulting $K$-color
image looks as much like the original $N$-color image
as possible. This is an optimization problem known to
be NP-complete in $K$. However, this paper shows that
by ordering the $N$ colors along their principal axis
and partitioning the color space with respect to this
ordering, the resulting constrained optimization
problem can be solved in $O(N + KM^{2})$ time by
dynamic programming (where $M$ is the intensity
resolution of the device).\par
Traditional color quantization algorithms recursively
bipartition the color space. By using the above
dynamic-programming algorithm, we can construct a
globally optimal $K$-partition, $K>2$, of a color space
in the principal direction of the input data. This new
partitioning strategy leads to smaller quantization
error and hence better image quality. Other algorithmic
issues in color quantization such as efficient
statistical computations and nearest-neighbor searching
are also studied. The interplay between luminance and
chromaticity in color quantization with and without
color dithering is investigated. Our color quantization
method allows the user to choose a balance between the
image smoothness and hue accuracy for a given $K$.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.4.1}: Computing Methodologies, IMAGE
PROCESSING, Digitization, Quantization. {\bf I.3.3}:
Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation, Digitizing and scanning. {\bf
I.4.2}: Computing Methodologies, IMAGE PROCESSING,
Compression (Coding), Approximate methods.",
}
@Article{Kasson:1992:ASC,
author = "James M. Kasson and Wil Plouffe",
title = "An Analysis of Selected Computer Interchange Color
Spaces",
journal = j-TOG,
volume = "11",
number = "4",
pages = "373--405",
month = oct,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/146479.html",
abstract = "Important standards for device-independent color allow
many different color encodings. This freedom obliges
users of these standards to choose the color space in
which to represent their data. A device-independent
interchange color space must exhibit an exact mapping
to a colorimetric color representation, ability to
encode all visible colors, compact representation for
given accuracy, and low computational cost for
transforms to and from device-dependent spaces. The
performance of CIE 1931 XYZ, CIELUV, CIELAB, YES, CCIR
601-2 YCbCr, and SMPTE-C RGB is measured against these
requirements. With extensions, all of these spaces can
meet the first two requirements. Quantizing error
dominates the representational errors of the tested
color spaces. Spaces that offer low quantization error
also have low gain for image noise. All linear spaces
are less compact than nonlinear alternatives. The
choice of nonlinearity is not critical; a wide range of
gammas yields acceptable results. The choice of
primaries for RGB representations is not critical,
except that high-chroma primaries should be avoided.
Quantizing the components of the candidate spaces with
varying precision yields only small improvements.
Compatibility with common image data compression
techniques leads to the requirement for low luminance
contamination, a property that compromises several
otherwise acceptable spaces. The conversion of a
device-independent representation to popular device
spaces by means of trilinear interpolation requires
substantially fewer lookup table entries with CCIR
601-2 YCbCr and CIELAB.",
acknowledgement = ack-nhfb,
keywords = "experimentation; measurement; standardization",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism. {\bf
I.4.1}: Computing Methodologies, IMAGE PROCESSING,
Digitization. {\bf I.4.1}: Computing Methodologies,
IMAGE PROCESSING, Digitization, Quantization.",
}
@Article{Stokes:1992:PRD,
author = "Mike Stokes and Mark D. Fairchild and Roy S. Berns",
title = "Precision Requirements for Digital Color
Reproduction",
journal = j-TOG,
volume = "11",
number = "4",
pages = "406--422",
month = oct,
year = "1992",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/146482.html",
abstract = "An environment was established to perform
device-independent color reproduction of full-color
pictorial images. In order to determine the required
precision for this environment, an experiment was
performed to psychophysically measure colorimetric
tolerances for six images using paired comparison
techniques. These images were manipulated using 10
linear and nonlinear functions in the CIELAB dimensions
of lightness, chroma, and hue angle. Perceptibility
tolerances were determined using probit analysis. From
these results, the necessary precision in number of
bits per color channel was determined for both the
CIELAB and the CRT rgb device color spaces. For both
the CIELAB color space and the CRT rgb device space,
approximately eight color bits per channel were
required for imperceptible color differences for
pictorial images, and 10 bits per channel were required
for computational precision.",
acknowledgement = ack-nhfb,
keywords = "algorithms; experimentation; measurement",
subject = "{\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques, Ergonomics. {\bf
I.2.10}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Vision and Scene Understanding,
Intensity, color, photometry, and thresholding. {\bf
I.3.3}: Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation, Display algorithms. {\bf
I.3.3}: Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation, Viewing algorithms. {\bf
I.4.1}: Computing Methodologies, IMAGE PROCESSING,
Digitization, Quantization. {\bf I.4.1}: Computing
Methodologies, IMAGE PROCESSING, Digitization,
Sampling.",
}
@Article{Seidel:1993:PFG,
author = "Hans-Peter Seidel",
title = "Polar Forms for Geometrically Continuous Spline Curves
of Arbitrary Degree",
journal = j-TOG,
volume = "12",
number = "1",
pages = "1--34",
month = jan,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/93.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/169726.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations.",
}
@Article{Shapiro:1993:SBC,
author = "Vadim Shapiro and Donald L. Vossler",
title = "Separation for Boundary to {CSG} Conversion",
journal = j-TOG,
volume = "12",
number = "1",
pages = "35--55",
month = jan,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/93.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/169723.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Boundary representations. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Constructive solid
geometry (CSG). {\bf I.4.0}: Computing Methodologies,
IMAGE PROCESSING, General.",
}
@Article{Paoluzzi:1993:DIM,
author = "A. Paoluzzi and F. Bernardini and C. Cattani and V.
Ferrucci",
title = "Dimension-Independent Modeling with Simplicial
Complexes",
journal = j-TOG,
volume = "12",
number = "1",
pages = "56--102",
month = jan,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/93.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/169719.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems. {\bf J.6}: Computer
Applications, COMPUTER-AIDED ENGINEERING,
Computer-aided design (CAD).",
}
@Article{Salesin:1993:ATO,
author = "David Salesin and Ronen Barzel",
title = "Adjustable Tools: An Object-Oriented Interaction
Metaphor",
journal = j-TOG,
volume = "12",
number = "1",
pages = "103--107",
month = jan,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/93.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/214378.html",
acknowledgement = ack-nhfb,
keywords = "design",
subject = "{\bf I.3.4}: Computing Methodologies, COMPUTER
GRAPHICS, Graphics Utilities.",
}
@Article{Rokne:1993:C,
author = "J. Rokne and Y. Yao",
title = "Corrigendum",
journal = j-TOG,
volume = "12",
number = "1",
pages = "108--108",
month = jan,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
note = "See \cite{Rokne:1992:DIL}.",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1993:AI,
author = "Anonymous",
title = "Author Index",
journal = j-TOG,
volume = "12",
number = "1",
pages = "109--110",
month = jan,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:57:52 1996",
acknowledgement = ack-pb,
}
@Article{DeRose:1993:FCA,
author = "Tony D. DeRose and Ronald N. Goldman and Hans Hagen
and Stephen Mann",
title = "Functional Composition Algorithms via Blossoming",
journal = j-TOG,
volume = "12",
number = "2",
pages = "113--135",
month = apr,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/151290.html",
abstract = "In view of the fundamental role that functional
composition plays in mathematics, it is not surprising
that a variety of problems in geometric modeling can be
viewed as instances of the following composition
problem: given representations for two functions $F$
and $G$, compute a representation of the function $H$ =
$F o G$. We examine this problem in detail for the case
when $F$ and $G$ are given in either B{\'e}zier or
B-spline form. Blossoming techniques are used to gain
theoretical insight into the structure of the solution
which is then used to develop efficient, tightly
codable algorithms. From a practical point of view, if
the composition algorithms are implemented as library
routines, a number of geometric-modeling problems can
be solved with a small amount of additional software.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD). {\bf G.1.2}:
Mathematics of Computing, NUMERICAL ANALYSIS,
Approximation, Spline and piecewise polynomial
approximation.",
}
@Article{Geist:1993:MFD,
author = "Robert Geist and Robert Reynolds and Darrell Suggs",
title = "A {Markovian} Framework for Digital Halftoning",
journal = j-TOG,
volume = "12",
number = "2",
pages = "136--159",
month = apr,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/151281.html",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.4.0}: Computing Methodologies, IMAGE
PROCESSING, General, Image displays. {\bf I.4.1}:
Computing Methodologies, IMAGE PROCESSING,
Digitization, Quantization. {\bf G.3}: Mathematics of
Computing, PROBABILITY AND STATISTICS, Probabilistic
algorithms (including Monte Carlo). {\bf I.3.3}:
Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation, Digitizing and scanning. {\bf
I.3.3}: Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation, Display algorithms. {\bf
I.3.3}: Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation. {\bf I.4.1}: Computing
Methodologies, IMAGE PROCESSING, Digitization.",
}
@Article{Elber:1993:SSA,
author = "Gershon Elber and Elaine Cohen",
title = "Second-Order Surface Analysis Using Hybrid Symbolic
and Numeric Operators",
journal = j-TOG,
volume = "12",
number = "2",
pages = "160--178",
month = apr,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/151283.html",
abstract = "Results from analyzing the curvature of a surface can
be used to improve the implementation, efficiency, and
effectiveness of manufacturing and visualization of
sculptured surfaces.\par
We develop a robust method using hybrid symbolic and
numeric operators to create trimmed surfaces, each of
which is solely convex, concave, or saddle and
partitions the original surface. The same method is
also used to identify regions whose curvature lies
within prespecified bounds.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems. {\bf I.3.5}:
Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Splines.",
}
@Article{Bartels:1993:ECS,
author = "Richard H. Bartels and John C. Beatty and Kellogg S.
Booth and Eric G. Bosch and Pierre Jolicoeur",
title = "Experimental Comparison of Splines Using the
Shape-Matching Paradigm",
journal = j-TOG,
volume = "12",
number = "3",
pages = "179--208",
month = jul,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/93.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/169709.html",
acknowledgement = ack-nhfb,
keywords = "design; experimentation; human factors; performance",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Splines. {\bf H.5.2}: Information Systems, INFORMATION
INTERFACES AND PRESENTATION, User Interfaces,
Evaluation/methodology. {\bf H.5.2}: Information
Systems, INFORMATION INTERFACES AND PRESENTATION, User
Interfaces, Interaction styles. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Curve, surface, solid,
and object representations. {\bf I.3.6}: Computing
Methodologies, COMPUTER GRAPHICS, Methodology and
Techniques, Interaction techniques.",
}
@Article{Paluszny:1993:FTC,
author = "Marco Paluszny and Richard R. Patterson",
title = "A Family of Tangent Continuous Cubic Algebraic
Splines",
journal = j-TOG,
volume = "12",
number = "3",
pages = "209--232",
month = jul,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/93.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/169707.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Splines. {\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD).",
}
@Article{Malzbender:1993:FVR,
author = "Tom Malzbender",
title = "Fourier Volume Rendering",
journal = j-TOG,
volume = "12",
number = "3",
pages = "233--250",
month = jul,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/93.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/169705.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; performance; theory",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Color, shading, shadowing, and texture. {\bf F.2.1}:
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Numerical Algorithms and Problems,
Computation of transforms. {\bf I.3.3}: Computing
Methodologies, COMPUTER GRAPHICS, Picture/Image
Generation, Display algorithms. {\bf I.3.6}: Computing
Methodologies, COMPUTER GRAPHICS, Methodology and
Techniques, Graphics data structures and data types.
{\bf I.4.1}: Computing Methodologies, IMAGE PROCESSING,
Digitization, Sampling. {\bf I.4.10}: Computing
Methodologies, IMAGE PROCESSING, Image Representation,
Volumetric.",
}
@Article{Fellner:1993:RRG,
author = "Dieter W. Fellner and Christoph Helmberg",
title = "Robust Rendering of General Ellipses and Elliptical
Arcs",
journal = j-TOG,
volume = "12",
number = "3",
pages = "251--276",
month = jul,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
bibsource = "Graphics/siggraph/93.bib",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/169704.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; performance",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Color, shading, shadowing, and texture.",
}
@Article{Kurlander:1993:ICM,
author = "David Kurlander and Steven Feiner",
title = "Inferring Constraints from Multiple Snapshots",
journal = j-TOG,
volume = "12",
number = "4",
pages = "277--304",
month = oct,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/159731.html",
abstract = "Many graphic tasks, such as the manipulation of
graphical objects and the construction of
user-interface widgets, can be facilitated by geometric
constraints. However, the difficulty of specifying
constraints by traditional methods forms a barrier to
their widespread use. In order to make constraints
easier to declare, we have developed a method of
specifying constraints implicitly, through multiple
examples. Snapshots are taken of an initial scene
configuration, and one or more additional snapshots are
taken after the scene has been edited into other valid
configurations. The constraints that are satisfied in
all of the snapshots are then applied to the scene
objects. We discuss an efficient algorithm for
inferring constraints from multiple snapshots. The
algorithm has been incorporated into the Chimera
editor, and several examples of its use are
discussed.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques, Interaction
techniques. {\bf D.2.2}: Software, SOFTWARE
ENGINEERING, Tools and Techniques, User interfaces.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.2.6}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Learning, Concept learning.",
}
@Article{Chen:1993:SIS,
author = "Lin-Lin Chen and Shuo-Yan Chou and Tony C. Woo",
title = "Separating and Intersecting Spherical Polygons:
Computing Machinability on Three-, Four-, and Five-Axis
Numerically Controlled Machines",
journal = j-TOG,
volume = "12",
number = "4",
pages = "305--326",
month = oct,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/159732.html",
abstract = "We consider the computation of an optimal workpiece
orientation allowing the maximal number of surfaces to
be machined in a single setup on a three-, four-, or
five-axis numerically controlled machine. Assuming the
use of a ball-end cutter, we establish the conditions
under which a surface is machinable by the cutter
aligned in a certain direction, without the cutter's
being obstructed by portions of the same surface. The
set of such directions is represented on the sphere as
a convex region, called the {\em visibility map} of the
surface. By using the Gaussian maps and the visibility
maps of the surfaces on a component, we can formulate
the optimal workpiece orientation problems as geometric
problems on the sphere. These and related geometric
problems include finding a densest hemisphere that
contains the largest subset of a given set of spherical
polygons, determining a great circle that separates a
given set of spherical polygons, computing a great
circle that bisects a given set of spherical polygons,
and finding a great circle that intersects the largest
or the smallest subset of a set of spherical polygons.
We show how all possible ways of intersecting a set of
$n$ spherical polygons with $v$ total number of
vertices by a great circle can be computed in $O(vn
\log n)$ time and represented as a spherical partition.
By making use of this representation, we present
efficient algorithms for solving the five geometric
problems on the sphere.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; performance",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems. {\bf
F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Geometrical problems and computations. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided manufacturing (CAM).",
}
@Article{Bajaj:1993:HIL,
author = "Chanderjit Bajaj and Ihm Insung and Joe Warren",
title = "Higher-Order Interpolation and Least-Squares
Approximation Using Implicit Algebraic Surfaces",
journal = j-TOG,
volume = "12",
number = "4",
pages = "327--347",
month = oct,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/159734.html",
abstract = "In this article, we characterize the solution space of
low-degree, implicitly defined, algebraic surfaces
which interpolate and/or least-squares approximate a
collection of scattered point and curve data in
three-dimensional space. The problem of higher-order
interpolation and least-squares approximation with
algebraic surfaces under a proper normalization reduces
to a quadratic minimization problem with elegant and
easily expressible solutions. We have implemented our
algebraic surface-fitting algorithms, and included them
in the distributed and collaborative geometric
environment SHASTRA. Several examples are given to
illustrate how our algorithms are applied to algebraic
surface design.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
Approximation, Least squares approximation. {\bf
G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS,
Optimization. {\bf I.3.5}: Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Geometric algorithms, languages, and systems.
{\bf F.2.1}: Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
and Problems, Computations on polynomials. {\bf J.6}:
Computer Applications, COMPUTER-AIDED ENGINEERING. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Interpolation formulas.",
}
@Article{Rappoport:1993:UDR,
author = "Ari Rappoport and Maarten van Emmerik",
title = "User-Interface Devices for Rapid and Exact Number
Specification",
journal = j-TOG,
volume = "12",
number = "4",
pages = "348--354",
month = oct,
year = "1993",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/214380.html",
acknowledgement = ack-nhfb,
keywords = "design; human factors",
subject = "{\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques, Interaction
techniques. {\bf I.3.4}: Computing Methodologies,
COMPUTER GRAPHICS, Graphics Utilities, Virtual device
interfaces. {\bf I.3.5}: Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Geometric algorithms, languages, and
systems.",
}
@Article{Foley:1994:SC,
author = "Jim Foley",
title = "Scope and Charter",
journal = j-TOG,
volume = "13",
number = "1",
pages = "1--1",
month = jan,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:42:18 1996",
acknowledgement = ack-nhfb,
}
@Article{Taubin:1994:DAR,
author = "Gabriel Taubin",
title = "Discrete Approximations for Rasterizing Implicit
Curves",
journal = j-TOG,
volume = "13",
number = "1",
pages = "3--42",
month = jan,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:42:26 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/174531.html",
abstract = "In this article we present new algorithms for
rasterizing implicit curves, i.e., curves represented
as level sets of functions of two variables.
Considering the pixels as square regions of the plane,
a ``correct'' algorithm should paint those pixels whose
centers lie at less than half the desired line width
from the curve. A straightforward implementation,
scanning the display array evaluating the Euclidean
distance from the center of each pixel to the curve, is
impractical, and a standard quad-tree-like recursive
subdivision scheme is used instead. Then we attack the
problem of testing whether or not the Euclidean
distance from a point to an implicit curve is less than
a given threshold. For the most general case, when the
implicit function is only required to have continuous
first-order derivatives, we show how to reformulate the
test as an unconstrained global root-finding problem in
a circular domain. For implicit functions with
continuous derivatives up to order $k$ we introduce an
approximate distance of order $k$. The approximate
distance of order $k$ from a point to an implicit curve
is asymptotically equivalent to the Euclidean distance
and provides a sufficient test for a polynomial of
degree $k$ not to have roots inside a circle. This is
the main contribution of the article. By replacing the
Euclidean distance test with one of these approximate
distance tests, we obtain a practical rendering
algorithm, proven to be correct for algebraic curves.
To speed up the computation we also introduce
heuristics, which used in conjunction with low-order
approximate distances almost always produce equivalent
results. The behavior of the algorithms is analyzed,
both near regular and singular points, and several
possible extensions and applications are discussed.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD).",
}
@Article{Edelsbrunner:1994:TAS,
author = "Herbert Edelsbrunner and Ernst P. M{\"{u}}cke",
title = "Three-Dimensional Alpha Shapes",
journal = j-TOG,
volume = "13",
number = "1",
pages = "43--72",
month = jan,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 16:06:13 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/156635.html",
abstract = "Frequently, data in scientific computing is in its
abstract form a finite point set in space, and it is
sometimes useful or required to compute what one might
call the ``shape'' of the set. For that purpose, this
article introduces the formal notion of the family of
[alpha]-shapes of a finite point set in $R^3$. Each
shape is a well-defined polytope, derived from the
Delaunay triangulation of the point set, with a
parameter [alpha] [epsilon] R controlling the desired
level of detail. An algorithm is presented that
constructs the entire family of shapes for a given set
of size $n$ in time $O(n^2)$, worst case. A robust
implementation of the algorithm is discussed, and
several applications in the area of scientific
computing are mentioned.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Geometrical problems and computations. {\bf
G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
Reliability and robustness. {\bf I.2.10}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Vision and
Scene Understanding, Representations, data structures,
and transforms. {\bf J.2}: Computer Applications,
PHYSICAL SCIENCES AND ENGINEERING. {\bf I.3.5}:
Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems.",
}
@Article{Manocha:1994:AIP,
author = "Dinesh Manocha and James Demmel",
title = "Algorithms for Intersecting Parametric and Algebraic
Curves {I}: Simple Intersections",
journal = j-TOG,
volume = "13",
number = "1",
pages = "73--100",
month = jan,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:42:39 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/174617.html",
abstract = "The problem of computing the intersection of
parametric and algebraic curves arises in many
applications of computer graphics and geometric and
solid modeling. Previous algorithms are based on
techniques from elimination theory or subdivision and
iteration. The former is, however, restricted to
low-degree curves. This is mainly due to issues of
efficiency and numerical stability. In this article we
use elimination theory and express the resultant of the
equations of intersection as matrix determinant. The
matrix itself rather than its symbolic determinant, a
polynomial, is used as the representation. The problem
of intersection is reduced to that of computing the
eigenvalues and eigenvectors of a numeric matrix. The
main advantage of this approach lies in its {\em
efficiency and robustness}. Moreover, the numerical
accuracy of these operations is well understood. For
almost all cases we are able to compute accurate
answers in 64-bit IEEE floating-point arithmetic.",
acknowledgement = ack-nhfb,
keywords = "algorithms; performance",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems. {\bf F.2.2}: Theory
of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems.",
}
@Article{Rossignac:1994:ISI,
author = "Jarek Rossignac",
title = "Introduction to the Special Issue on Interactive
Sculpting",
journal = j-TOG,
volume = "13",
number = "2",
pages = "101--102",
month = apr,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Tue Sep 06 19:22:43 1994",
acknowledgement = ack-nhfb,
}
@Article{Terzopoulos:1994:DNG,
author = "Demetri Terzopoulos and Hong Qin",
title = "Dynamic {NURBS} with Geometric Constraints to
Interactive Sculpting",
journal = j-TOG,
volume = "13",
number = "2",
pages = "103--136",
month = apr,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:42:54 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/176580.html",
abstract = "This article develops a dynamic generalization of the
nonuniform rational B-spline (NURBS) model. NURBS have
become a de facto standard in commercial modeling
systems because of their power to represent free-form
shapes as well as common analytic shapes. To date,
however, they have been viewed as purely geometric
primitives that require the user to manually adjust
multiple control points and associated weights in order
to design shapes. Dynamic NURBS, or D-NURBS, are
physics-based models that incorporate mass
distributions, internal deformation energies, and other
physical quantities into the popular NURBS geometric
substrate. Using D-NURBS, a modeler can interactively
sculpt curves and surfaces and design complex shapes to
required specifications not only in the traditional
indirect fashion, by adjusting control points and
weights, but also through direct physical manipulation,
by applying simulated forces and local and global shape
constraints. D-NURBS move and deform in a physically
intuitive manner in response to the user's direct
manipulations. Their dynamic behavior results from the
numerical integration of a set of nonlinear
differential equations that automatically evolve the
control points and weights in response to the applied
forces and constraints. To derive these equations, we
employ Lagrangian mechanics and a finite-element-like
discretization. Our approach supports the trimming of
D-NURBS surfaces using D-NURBS curves. We demonstrate
D-NURBS models and constraints in applications
including the rounding of solids, optimal surface
fitting to unstructured data, surface design from cross
sections, and free-form deformation. We also introduce
a new technique for 2D shape metamorphosis using
constrained D-NURBS surfaces.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Physically
based modeling. {\bf I.3.6}: Computing Methodologies,
COMPUTER GRAPHICS, Methodology and Techniques,
Interaction techniques.",
}
@Article{Borrel:1994:SCD,
author = "Paul Borrel and Ari Rappoport",
title = "Simple Constrained Deformations for Geometric Modeling
and Interactive Design",
journal = j-TOG,
volume = "13",
number = "2",
pages = "137--155",
month = apr,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:43:07 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/176581.html",
abstract = "Deformations are a powerful tool for shape modeling
and design. We present a new model for producing
controlled spatial deformations, which we term {\em
Simple Constrained Deformations (Scodef)}. The user
defines a set of constraint points, giving a desired
displacement and radius of influence for each. Each
constraint point determines a local B-spline basis
function centered at the constraint point, falling to
zero for points beyond the radius. The deformed image
of any point in space is a blend of these basis
functions, using a projection matrix computed to
satisfy the constraints. The deformation operates on
the whole space regardless of the representation of the
objects embedded inside the space. The constraints
directly influence the final shape of the deformed
objects, and this shape can be fine-tuned by adjusting
the radius of influence of each constraint point. The
computations required by the technique can be done very
efficiently, and real-time interactive deformation
editing on current workstations is possible.",
acknowledgement = ack-nhfb,
keywords = "design",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Splines.",
}
@Article{Rappoport:1994:IDS,
author = "Ari Rappoport and Yaacov {Hel-Or} and Michael Werman",
title = "Interactive Design of Smooth Objects with
Probabilistic Point Constraints",
journal = j-TOG,
volume = "13",
number = "2",
pages = "156--176",
month = apr,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 15:43:17 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/176582.html",
abstract = "Point displacement constraints constitute an
attractive technique for interactive design of smooth
curves, surfaces, and volumes. The user defines an
arbitrary number of ``control points'' on the object
and specifies their desired spatial location, while the
system computes the object's degrees of freedom so that
the constraints are satisfied. A constraint-based
interface gives a feeling of direct manipulation of the
object. In this article we introduce {\em soft
constraints}, constraints which do not have to be met
exactly. The softness of each constraint serves as a
nonisotropic, local {\em shape parameter} enabling the
user to explore the space of objects conforming to the
constraints. Additionally, there is a global shape
parameter which determines the amount of similarity of
the designed object to a rest shape, or equivalently,
the rigidity of the rest shape.\par
We present an algorithm termed {\em probabilistic point
constraints (PPC)} for implementing soft constraints.
The PPC algorithm views constraints as stochastic
measurements of the state of a static system. The
softness of a constraint is derived from the {\em
covariance} of the ``measurement.'' The resulting
system of probabilistic equations is solved using the
{\em Kalman filter}, a powerful estimation tool in the
theory of stochastic systems. We also describe a user
interface using {\em direct-manipulation devices} for
specifying and visualizing covariances in 2D and
3D.\par
The algorithm is suitable for any object represented as
a parametric blend of control points, including most
spline representations. The covariance of a constraint
provides a continuous transition from exact
interpolation to controlled approximation of the
constraint. The algorithm involves only linear
operations and allows real-time interactive direct
manipulation of curves and surfaces on current
workstations.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Spline and piecewise polynomial
interpolation. {\bf G.1.2}: Mathematics of Computing,
NUMERICAL ANALYSIS, Approximation, Least squares
approximation. {\bf G.1.2}: Mathematics of Computing,
NUMERICAL ANALYSIS, Approximation, Spline and piecewise
polynomial approximation. {\bf I.3.4}: Computing
Methodologies, COMPUTER GRAPHICS, Graphics Utilities,
Graphics editors. {\bf I.3.5}: Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Splines.",
}
@Article{Vemuri:1994:MSH,
author = "B. C. Vemuri and A. Radisavljevic",
title = "Multiresolution Stochastic Hybrid Shape Models with
Fractal Priors",
journal = j-TOG,
volume = "13",
number = "2",
pages = "177--207",
month = apr,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 06 18:01:36 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/176583.html",
abstract = "3D shape modeling has received enormous attention in
computer graphics and computer vision over the past
decade. Several shape modeling techniques have been
proposed in literature, some are local (distributed
parameter) while others are global (lumped parameter)
in terms of the parameters required to describe the
shape. Hybrid models that combine both ends of this
parameter spectrum have been in vogue only recently.
However, they do not allow a smooth transition between
the two extremes of this parameter spectrum.\par
We introduce a {\em new shape-modeling scheme} that can
{\em transform smoothly from local to global} models or
vice versa. The modeling scheme utilizes a hybrid
primitive called the deformable superquadric {\em
constructed in an orthonormal wavelet basis}. The
multiresolution wavelet basis provides the power to
continuously transform from local to global shape
deformations and thereby allow for a continuum of shape
models---from those with local to those with global
shape descriptive power---to be created. The
multiresolution wavelet basis allows us to generate
fractal surfaces of arbitrary order that can be useful
in describing natural detail.\par
We embed these multiresolution shape models in a
probabilistic framework and use them for recovery of
anatomical structures in the human brain from MRI data.
A salient feature of our modeling scheme is that it can
naturally allow for the incorporation of prior
statistics of a rich variety of shapes. This stems from
the fact that, unlike other modeling schemes, in our
modeling, we require relatively few parameters to
describe a large class of shapes.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.2.10}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Vision and Scene Understanding, Modeling
and recovery of physical attributes. {\bf G.1.8}:
Mathematics of Computing, NUMERICAL ANALYSIS, Partial
Differential Equations, Finite element methods. {\bf
G.3}: Mathematics of Computing, PROBABILITY AND
STATISTICS, Statistical computing. {\bf I.2.10}:
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Vision and Scene Understanding, Shape. {\bf I.3.5}:
Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Curve,
surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Hierarchy
and geometric transformations. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Physically based
modeling. {\bf I.3.5}: Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Splines. {\bf I.3.8}: Computing
Methodologies, COMPUTER GRAPHICS, Applications.",
}
@Article{Hudson:1994:UIS,
author = "Scott E. Hudson",
title = "User Interface Specification Using an Enhanced
Spreadsheet Model",
journal = j-TOG,
volume = "13",
number = "3",
pages = "209--239",
month = jul,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:40:37 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/195787.html",
abstract = "This paper describes a new interactive environment for
user interface specification which is based on an
enhanced spreadsheet model of computation. This
environment allows sophisticated graphical user
interfaces with dynamic feedback to be implemented with
little or no explicit programming. Its goal is to
support user interface specification by nonprogramming
experts in human factors, visual design, or the
application domain. In addition, the system is designed
to allow sophisticated end-users to modify and
customize their own interfaces. The system is based on
a data flow model of computation. This model is
presented to the interface designer in the form of a
spreadsheet enhanced with new constructs for easier
programming and reuse. These constructs include an
improved interactive programming environment, a
prototype-instance-based inheritance system, support
for composition, abstraction, and customization using
indirect references, the addition of support for
graphical inputs and outputs, and support for the
encapsulation of application data structures and
routines within system objects.",
acknowledgement = ack-nhfb,
keywords = "human factors; languages",
subject = "{\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques. {\bf D.2.2}:
Software, SOFTWARE ENGINEERING, Tools and Techniques,
User interfaces. {\bf D.2.6}: Software, SOFTWARE
ENGINEERING, Programming Environments, Interactive.
{\bf D.2.m}: Software, SOFTWARE ENGINEERING,
Miscellaneous, Rapid prototyping.",
}
@Article{Klassen:1994:EIH,
author = "R. Victor Klassen",
title = "Exact Integer Hybrid Subdivision and Forward
Differencing of Cubics",
journal = j-TOG,
volume = "13",
number = "3",
pages = "240--255",
month = jul,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:40:37 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/197476.html",
abstract = "Forward differencing is widely used to generate
rapidly large numbers of points at equally space
parameter values along a curve. A failing of forward
differencing is the tendency to generate many
extraneous points for curves with highly nonuniform
parameterizations. A key result is presented and
proven, namely, that a few levels of subdivision, prior
to initialization for forward differencing, can improve
substantially the quality of the step size estimate,
resulting in very few extra points. The initial
subdivisions can be done without loss of the exact
integer precision available in forward differencing.
For small numbers of points---a common occurrence in
fonts---exact subdivision is even faster than exact
forward differencing. When exact subdivision is used in
conjunction with a previously presented exact
forward-differencing algorithm, arbitrary cubic curves
may be rendered with 32-bit arithmetic and guaranteed
single-pixel accuracy, in a grid with an address space
as large as 0..7281, with no two generated points
greater than one pixel apart. This is more steps than
previously possible. Previous discussions of rendering
using subdivision have concentrated not on distance but
on straightness estimates, whereby subdivision can be
stopped once a subcurve can be drawn safely using its
polygonal approximation. In this article, bounds are
also derived on the size of the control polygon after
multiple levels of subdivision: these are used to
determine bounds on the number of steps required for
differencing. It is shown that any curve whose
rasterization fits in a space of $\omega$ pixels
requires no more than $9\omega$ steps.",
acknowledgement = ack-nhfb,
keywords = "algorithms; reliability",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Splines. {\bf G.1.2}: Mathematics of Computing,
NUMERICAL ANALYSIS, Approximation, Spline and piecewise
polynomial approximation.",
}
@Article{Hart:1994:VQR,
author = "John C. Hart and George K. Francis and Louis H.
Kauffman",
title = "Visualizing Quaternion Rotation",
journal = j-TOG,
volume = "13",
number = "3",
pages = "256--276",
month = jul,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:40:37 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/197480.html",
abstract = "Quaternions play a vital role in the representation of
rotations in computer graphics, primarily for animation
and user interfaces. Unfortunately, quaternion rotation
is often left as an advanced topic in computer graphics
education due to difficulties in portraying the
four-dimensional space of the quaternions. One tool for
overcoming these obstacles is the quaternion
demonstrator, a physical visual aid consisting
primarily of a belt. Every quaternion used to specify a
rotation can be represented by fixing one end of the
belt and rotating the other. Multiplication of
quaternions is demonstrated by the composition of
rotations, and the resulting twists in the belt depict
visually how quaternions interpolate rotation.\par
This article introduces to computer graphics the
exponential notation that mathematicians have used to
represent unit quaternions. Exponential notation
combines the angle and axis of the rotation into
concise quaternion expression. This notation allows the
article to present more clearly a mechanical quaternion
demonstrator consisting of a ribbon and a tag, and
develop a computer simulation suitable for interactive
educational packages. Local deformations and the belt
trick are used to minimize the ribbon's twisting and
simulate a natural-appearing interactive quaternion
demonstrator.",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Hierarchy and geometric transformations. {\bf I.3.6}:
Computing Methodologies, COMPUTER GRAPHICS, Methodology
and Techniques, Graphics data structures and data
types.",
}
@Article{Niizeki:1994:PII,
author = "Masatoshi Niizeki and Fujio Yamaguchi",
title = "Projectively Invariant Intersection Detections for
Solid Modeling",
journal = j-TOG,
volume = "13",
number = "3",
pages = "277--299",
month = jul,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:40:37 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/197485.html",
abstract = "An intersection detection method for solid modeling
which is invariant under projective transformations is
presented. We redefine the fundamental geometric
figures necessary to describe solid models and their
dual figures in a homogeneous coordinate
representation. Then we derive conditions, which are
projectively invariant, for intersections between these
primitives. We will show that a geometric processor
based on the 4 x 4 determinant method is applicable to
a wide range of problems with little modification. This
method has applications in intersection detections of
rational parametric curves and surfaces and
hidden-line/surface removal algorithms.",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems. {\bf
F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on matrices. {\bf F.2.2}: Theory
of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Geometrical problems and computations. {\bf G.1.3}:
Mathematics of Computing, NUMERICAL ANALYSIS, Numerical
Linear Algebra, Determinants. {\bf I.3.4}: Computing
Methodologies, COMPUTER GRAPHICS, Graphics Utilities,
Application packages. {\bf J.6}: Computer Applications,
COMPUTER-AIDED ENGINEERING, Computer-aided design
(CAD).",
}
@Article{Rodham:1994:STM,
author = "Kenneth J. Rodham and Dan R. {Olsen, Jr.}",
title = "Smart Telepointers: Maintaining Telepointer
Consistency in the Presence of User Interface
Customization",
journal = j-TOG,
volume = "13",
number = "3",
pages = "300--307",
month = jul,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:40:37 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/197492.html",
abstract = "Conventional methods for maintaining telepointer
consistency in shared windows do not work in the
presence of per-user window customizations. This
article presents the notion of a ``smart telepointer,''
which is a telepointer that works correctly in spite of
such customizations. Methods for smart-telepointer
implementation are discussed.",
acknowledgement = ack-nhfb,
keywords = "human factors",
subject = "{\bf H.5.2}: Information Systems, INFORMATION
INTERFACES AND PRESENTATION, User Interfaces,
Interaction styles. {\bf H.5.2}: Information Systems,
INFORMATION INTERFACES AND PRESENTATION, User
Interfaces, Windowing systems. {\bf H.5.3}: Information
Systems, INFORMATION INTERFACES AND PRESENTATION, Group
and Organization Interfaces, Synchronous interaction.",
}
@Article{Baker:1994:CAL,
author = "Henry G. Baker",
title = "Corrigenda: ``{Intersection Algorithms for Lines and
Circles}''",
journal = j-TOG,
volume = "13",
number = "3",
pages = "308--310",
month = jul,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:40:37 1996",
note = "See \cite{Middleditch:1989:IAL}.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/197874.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; reliability; theory",
subject = "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
ANALYSIS, General, Error analysis. {\bf G.1.0}:
Mathematics of Computing, NUMERICAL ANALYSIS, General,
Computer arithmetic. {\bf G.1.0}: Mathematics of
Computing, NUMERICAL ANALYSIS, General, Condition (and
ill-condition). {\bf G.1.0}: Mathematics of Computing,
NUMERICAL ANALYSIS, General, Stability (and
instability). {\bf I.3.5}: Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Curve, surface, solid, and object
representations. {\bf I.3.5}: Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Geometric algorithms, languages, and systems.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Hierarchy and geometric transformations. {\bf I.3.5}:
Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Modeling
packages.",
}
@Article{Zhao:1994:IKP,
author = "Jianmin Zhao and Norman I. Badler",
title = "Inverse Kinematics Positioning Using Nonlinear
Programming for Highly Articulated Figures",
journal = j-TOG,
volume = "13",
number = "4",
pages = "313--336",
month = oct,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:49:28 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/195827.html",
abstract = "An articulated figure is often modeled as a set of
rigid segments connected with joints. Its configuration
can be altered by varying the joint angles. Although it
is straight forward to compute figure configurations
given joint angles (forward kinematics), it is more
difficult to find the joint angles for a desired
configuration (inverse kinematics). Since the inverse
kinematics problem is of special importance to an
animator wishing to set a figure to a posture
satisfying a set of positioning constraints,
researchers have proposed several different approaches.
However, when we try to follow these approaches in an
interactive animation system where the object on which
to operate is as highly articulated as a realistic
human figure, they fail in either generality or
performance. So, we approach this problem through
nonlinear programming techniques. It has been
successfully used since 1988 in the spatial constraint
system within {\em Jack}, a human figure simulation
system developed at the University of Pennsylvania, and
proves to be satisfactorily efficient, controllable,
and robust. A spatial constraint in our system involves
two parts: one constraint on the figure, the {\em
end-effector}, and one on the spatial environment, the
{\em goal}. These two parts are dealt with separately,
so that we can achieve a neat modular implementation.
Constraints can be added one at a time with appropriate
weights designating the importance of this constraint
relative to the others and are always solved as a
group. If physical limits prevent satisfaction of all
the constraints, the system stops with the (possibly
local) optimal solution for the given weights. Also,
the rigidity of each joint angle can be controlled,
which is useful for redundant degrees of freedom.",
acknowledgement = ack-nhfb,
keywords = "algorithms; performance",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Animation. {\bf I.3.8}: Computing Methodologies,
COMPUTER GRAPHICS, Applications.",
}
@Article{Gelder:1994:TCI,
author = "Allen Van Gelder and Jane Wilhelms",
title = "Topological Considerations in Isosurface Generation",
journal = j-TOG,
volume = "13",
number = "4",
pages = "337--375",
month = oct,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:49:28 1996",
note = "See corrigendum: \cite{Gelder:1995:CCI}.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/195828.html",
abstract = "A popular technique for rendition of isosurfaces in
sampled data is to consider cells with sample points as
corners and approximate the isosurface in each cell by
one or more polygons whose vertices are obtained by
interpolation of the sample data. That is, each polygon
vertex is a point on a cell edge, between two adjacent
sample points, where the function is estimated to equal
the desired threshold value. The two sample points have
values on opposite sides of the threshold, and the
interpolated point is called an {\em intersection
point}.\par
When one cell face has an intersection point in each of
its four edges, then the correct connection among
intersection points becomes ambiguous. An incorrect
connection can lead to erroneous topology in the
rendered surface, and possible discontinuities. We show
that disambiguation methods, to be at all accurate,
need to consider sample values in the neighborhood
outside the cell. This paper studies the problems of
disambiguation, reports on some solutions, and presents
some statistics on the occurrence of such
ambiguities.\par
A natural way to incorporate neighborhood information
is through the use of calculated gradients at cell
corners. They provide insight into the behavior of a
function in well-understood ways. We introduce two {\em
gradient consistency heuristics} that use calculated
gradients at the corners of ambiguous faces, as well as
the function values at those corners, to disambiguate
at a reasonable computational cost. These methods give
the correct topology on several examples that caused
problems for other methods we examined.",
acknowledgement = ack-nhfb,
keywords = "algorithms; experimentation; performance; theory;
verification",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Boundary representations. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Curve, surface, solid,
and object representations. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Geometric algorithms,
languages, and systems.",
}
@Article{Paglieroni:1994:HDD,
author = "David W. Paglieroni and Sidney M. Petersen",
title = "Height Distributional Distance Transform Methods for
Height Field Ray Tracing",
journal = j-TOG,
volume = "13",
number = "4",
pages = "376--399",
month = oct,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:49:28 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/197312.html",
abstract = "Height distributional distance transform (HDDT)
methods are introduced as a new class of methods for
height field ray tracing. HDDT methods utilize results
of height field preprocessing. The preprocessing
involves computing a height field transform
representing an array of cone-like volumes of empty
space above the height field surface that are as wide
as possible. There is one cone-like volume balanced on
its apex centered above each height field cell. Various
height field transforms of this type are developed.
Each is based on distance transforms of height field
horizontal cross-sections. HDDT methods trace rays
through empty cone-like volumes instead of through
successive height field cells. The performance of HDDT
methods is evaluated experimentally against existing
height field ray tracing methods.",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Raytracing. {\bf I.3.3}: Computing Methodologies,
COMPUTER GRAPHICS, Picture/Image Generation, Display
algorithms. {\bf I.3.3}: Computing Methodologies,
COMPUTER GRAPHICS, Picture/Image Generation, Viewing
algorithms.",
}
@Article{Shene:1994:LDI,
author = "Ching-Kuang Shene and John K. Johnstone",
title = "On the Lower Degree Intersections of Two Natural
Quadrics",
journal = j-TOG,
volume = "13",
number = "4",
pages = "400--424",
month = oct,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:49:28 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/197316.html",
abstract = "In general, two quadric surface intersect in a space
quartic curve. However, the intersection frequently
degenerates to a collection of plane curves. Degenerate
cases are frequent in geometric/solid modeling because
degeneracies are often required by design. Their
detection is important because degenerate intersections
can be computed more easily and allow simpler treatment
of important problems. In this paper, we investigate
this problem for natural quadrics. Algorithms are
presented to detect and compute conic intersections and
linear intersections. These methods reveal the
relationship between the planes of the degenerate
intersections and the quadrics. Using the theory
developed in the paper, we present a new and simplified
proof of a necessary and sufficient condition for conic
intersection. Finally, we present a simple method for
determining the types of conic in a degenerate
intersection without actually computing the
intersection, and an enumeration of all possible conic
types. Since only elementary geometric routines such as
line intersection are used, all of the above algorithms
are intuitive and easily implementable.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD).",
}
@Article{Anonymous:1994:AI,
author = "Anonymous",
title = "Author Index",
journal = j-TOG,
volume = "13",
number = "4",
pages = "425--426",
month = oct,
year = "1994",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:49:28 1996",
acknowledgement = ack-nhfb,
}
@Article{Foley:1995:SC,
author = "Jim Foley",
title = "Scope and Charter",
journal = j-TOG,
volume = "14",
number = "1",
pages = "1--2",
month = jan,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
acknowledgement = ack-nhfb,
}
@Article{Ware:1995:UVT,
author = "Colin Ware and William Knight",
title = "Using Visual Texture for Information Display",
journal = j-TOG,
volume = "14",
number = "1",
pages = "3--20",
month = jan,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/200974.html",
abstract = "Results from vision research are applied to the
synthesis of visual texture for the purposes of
information display. The literature surveyed suggests
that the human visual system processes spatial
information by means of parallel arrays of neurons that
can be modeled by Gabor functions. Based on the Gabor
model, it is argued that the fundamental dimensions of
texture for human perception are orientation, size
(1/frequency), and contrast. It is shown that there are
a number of trade-offs in the density with which
information can be displayed using texture. Two of
these are (1) a trade-off between the size of the
texture elements and the precision with which the
location can be specified, and (2) the precision with
which texture orientation can be specified and the
precision with which texture size can be specified. Two
algorithms for generating texture are included.",
acknowledgement = ack-nhfb,
keywords = "algorithms; human factors",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques. {\bf I.3.7}:
Computing Methodologies, COMPUTER GRAPHICS,
Three-Dimensional Graphics and Realism, Color, shading,
shadowing, and texture. {\bf I.4.3}: Computing
Methodologies, IMAGE PROCESSING, Enhancement,
Filtering.",
}
@Article{Karasick:1995:ISM,
author = "Michael Karasick and David Strip",
title = "Intersecting Solids on a Massively Parallel
Processor",
journal = j-TOG,
volume = "14",
number = "1",
pages = "21--57",
month = jan,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/200976.html",
abstract = "Solid modeling underlies many technologies that are
key to modern manufacturing. These range from CAD
systems to robot simulators, from finite-element
analysis to integrated circuit process modeling. The
accuracy, and hence the utility, of these models is
often constrained by the amount of computer time
required to perform the desired operations. In this
paper we present, in detail, an efficient algorithm for
parallel intersections of solids using the Connection
Machine, a massively parallel SIMD processor. We
describe the data structure for representing the solid
models and detail the intersection algorithm, giving
special attention to implementation issues. We provide
performance results, comparing the parallel algorithm
to a serial intersection algorithm.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
Approximation, Least squares approximation. {\bf
G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
Approximation, Spline and piecewise polynomial
approximation. {\bf I.3.5}: Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Splines.",
}
@Article{Glassner:1995:DR,
author = "A. S. Glassner and K. P. Fishkin and D. H. Marimont
and M. C. Stone",
title = "Device-Directed Rendering",
journal = j-TOG,
volume = "14",
number = "1",
pages = "58--76",
month = jan,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/200977.html",
abstract = "Rendering systems can produce images that include the
entire range of visible colors. Imaging hardware,
however, can reproduce only a subset of these colors:
the device gamut. An image can only be correctly
displayed if all of its colors lie inside of the gamut
of the target device. Current solutions to this problem
are either to correct the scene colors by hand, or to
apply gamut mapping techniques to the final image. We
propose a methodology called {\em device-directed
rendering} that performs scene color adjustments
automatically. Device-directed rendering applies
classic minimization techniques to a symbolic
representation of the image that describes the
relationship of the scene lights and surfaces to the
pixel colors. This representation can then be evaluated
to produce an image that is guaranteed to be in gamut.
Although our primary application has been correcting
out-of-gamut colors, this methodology can be generally
applied to the problem of adjusting a scene description
to accommodate constraints on the output image pixel
values.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Color, shading, shadowing, and texture. {\bf I.3.3}:
Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation, Viewing algorithms. {\bf
I.3.6}: Computing Methodologies, COMPUTER GRAPHICS,
Methodology and Techniques, Device independence.",
}
@Article{Pattanaik:1995:AER,
author = "S. N. Pattanaik and S. P. Mudur",
title = "Adjoint Equations and Random Walks for Illumination
Computation",
journal = j-TOG,
volume = "14",
number = "1",
pages = "77--102",
month = jan,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/200985.html",
abstract = "In this paper we introduce the potential equation that
along with the rendering equation forms an adjoint
system of equations and provides a mathematical frame
work for all known approaches to illumination
computation based on geometric optics. The potential
equation is more natural for illumination computations
that simulate light propagation starting from the light
sources, such as progressive radiosity and particle
tracing. Using the mathematical handles provided by
this framework and the random-walk solution model, we
present a number of importance sampling schemes for
improving the computation of flux estimation. Of
particular significance is the use of approximately
computed potential for directing a majority of the
random walks through regions of importance in the
environment, thus reducing the variance in the
estimates of luminous flux in these regions. Finally,
results from a simple implementation are presented to
demonstrate the high-efficiency improvements made
possible by the use of these techniques.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; experimentation",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism. {\bf
I.3.3}: Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation.",
}
@Article{Bajaj:1995:MCA,
author = "Chanderjit L. Bajaj and Jindon Chen and Guoliang Xu",
title = "Modeling with Cubic {A}-Patches",
journal = j-TOG,
volume = "14",
number = "2",
pages = "103--133",
month = apr,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/221662.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; performance; theory",
subject = "{\bf I.4.7}: Computing Methodologies, IMAGE
PROCESSING, Feature Measurement, Size and shape. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD). {\bf G.1.1}:
Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Interpolation formulas. {\bf I.3.5}:
Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems. {\bf G.2.2}:
Mathematics of Computing, DISCRETE MATHEMATICS, Graph
Theory.",
}
@Article{Forsey:1995:SFH,
author = "David Forsey and Richard H. Bartels",
title = "Surface Fitting with Hierarchical Splines",
journal = j-TOG,
volume = "14",
number = "2",
pages = "134--161",
month = apr,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/221665.html",
acknowledgement = ack-nhfb,
keywords = "performance; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Spline and piecewise polynomial
interpolation. {\bf F.2.1}: Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Numerical Algorithms and Problems, Computations on
matrices.",
}
@Article{Peters:1995:SPM,
author = "Jorg Peters",
title = "Smoothing Polyhedra Made Easy",
journal = j-TOG,
volume = "14",
number = "2",
pages = "162--170",
month = apr,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/221670.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; performance",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation, Smoothing. {\bf G.1.1}: Mathematics of
Computing, NUMERICAL ANALYSIS, Interpolation, Spline
and piecewise polynomial interpolation.",
}
@Article{Sapidis:1995:DCP,
author = "Nickolas S. Sapidis and Paul J. Best",
title = "Direct Construction of Polynomial Surfaces from Dense
Range Images through Region Growing",
journal = j-TOG,
volume = "14",
number = "2",
pages = "171--200",
month = apr,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Jan 5 07:58:42 MST 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/221672.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; experimentation; performance; theory",
subject = "{\bf I.4.5}: Computing Methodologies, IMAGE
PROCESSING, Reconstruction. {\bf I.4.6}: Computing
Methodologies, IMAGE PROCESSING, Segmentation, Edge and
feature detection. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Curve, surface, solid,
and object representations. {\bf G.1.2}: Mathematics of
Computing, NUMERICAL ANALYSIS, Approximation. {\bf
G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
Approximation, Spline and piecewise polynomial
approximation.",
}
@Article{Foley:1995:E,
author = "Jim Foley",
title = "Editorial",
journal = j-TOG,
volume = "14",
number = "3",
pages = "201--201",
month = jul,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:33:38 1996",
acknowledgement = ack-nhfb,
}
@Article{Christensen:1995:ESA,
author = "Jon Christensen and Joe Marks and Stuart Shieber",
title = "An Empirical Study of Algorithms for Point-Feature
Label Placement",
journal = j-TOG,
volume = "14",
number = "3",
pages = "203--232",
month = jul,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:33:38 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/212334.html",
abstract = "A major factor affecting the clarity of graphical
displays that include text labels is the degree to
which labels obscure display features (including other
labels) as a result of spatial overlap. Point-feature
label placement (PFLP) is the problem of placing text
labels adjacent to point features on a map or diagram
so as to maximize legibility. This problem occurs
frequently in the production of many types of
informational graphics, though it arises most often in
automated cartography. In this paper we present a
comprehensive treatment of the PFLP problem, viewed as
a type of combinatorial optimization problem.
Complexity analysis reveals that the basic PFLP problem
and most interesting variants of it are NP-hard. These
negative results help inform a survey of previously
reported algorithms for PFLP; not surprisingly, all
such algorithms either have exponential time complexity
or are incomplete. To solve the PFLP problem in
practice, then, we must rely on good heuristic methods.
We propose two new methods, one based on a discrete
form of gradient descent, the other on simulated
annealing, and report on a series of empirical tests
comparing these and the other known algorithms for the
problem. Based on this study, the first to be
conducted, we identify the best approaches as a
function of available computation time.",
acknowledgement = ack-nhfb,
keywords = "algorithms; experimentation",
subject = "{\bf I.2.1}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Applications and Expert Systems,
Cartography. {\bf H.5.2}: Information Systems,
INFORMATION INTERFACES AND PRESENTATION, User
Interfaces, Screen design. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Geometric algorithms,
languages, and systems. {\bf I.2.8}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Problem
Solving, Control Methods, and Search, Heuristic
methods.",
}
@Article{Neumann:1995:RHM,
author = "L{\'{a}}szl{\'{o}} Neumann and Attila Neumann",
title = "Radiosity and Hybrid Methods",
journal = j-TOG,
volume = "14",
number = "3",
pages = "233--265",
month = jul,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:33:38 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/212347.html",
abstract = "We examine various solutions to the global
illumination problem, based on an exact mathematical
analysis of the rendering equation. In addition to
introducing efficient radiosity algorithms, we present
a uniform approach to reformulate all of the basic
radiosity equations used so far. Using hybrid methods
we are able to analyze possible combinations of the
view-dependent ray-tracing method and of the
low-resolution radiosity-based method, and to offer new
algorithms.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Radiosity. {\bf I.3.3}: Computing Methodologies,
COMPUTER GRAPHICS, Picture/Image Generation, Display
algorithms. {\bf I.3.7}: Computing Methodologies,
COMPUTER GRAPHICS, Three-Dimensional Graphics and
Realism, Color, shading, shadowing, and texture. {\bf
I.3.7}: Computing Methodologies, COMPUTER GRAPHICS,
Three-Dimensional Graphics and Realism, Raytracing.",
}
@Article{Paoluzzi:1995:GPP,
author = "Alberto Paoluzzi and Valerio Pascucci and Michele
Vicentino",
title = "Geometric Programming: {A} Programming Approach to
Geometric Design",
journal = j-TOG,
volume = "14",
number = "3",
pages = "266--306",
month = jul,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:33:38 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/212349.html",
abstract = "This article presents a functional programming
approach to geometric design with embedded polyhedral
complexes. Its main goals are to show the expressive
power of the language as well as its usefulness for
geometric design. The language, named PLASM (the
Programming LAnguage for Solid Modeling), introduces a
very high level approach to ``constructive'' or
``generative'' modeling. Geometrical objects are
generated by evaluating some suitable language
expressions. Because generating expressions can be
easily combined, the language also extends the standard
variational geometry approach by supporting classes of
geometric objects with varying topology and shape. The
design language PLASM can be roughly considered as a
geometry-oriented extension of a subset of the
functional language FL. The language takes a
dimension-independent approach to geometry
representation and algorithms. In particular it
implements an algebraic calculus over embedded
polyhedra of any dimension. The generated objects are
always geometrically consistent because the validity of
geometry is guaranteed at a syntactical level. Such an
approach allows one to use a representation scheme
which is weaker than those usually adopted in solid
modelers, thus encompassing a broader geometric domain,
which contains solids, surfaces, and wire-frames, as
well as higher-dimensional objects.",
acknowledgement = ack-nhfb,
keywords = "design; languages; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems. {\bf
D.1.1}: Software, PROGRAMMING TECHNIQUES, Applicative
(Functional) Programming. {\bf D.3.2}: Software,
PROGRAMMING LANGUAGES, Language Classifications,
Applicative languages. {\bf D.3.2}: Software,
PROGRAMMING LANGUAGES, Language Classifications, Design
languages. {\bf I.3.5}: Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Curve, surface, solid, and object
representations. {\bf I.3.5}: Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Hierarchy and geometric transformations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Object
hierarchies. {\bf J.6}: Computer Applications,
COMPUTER-AIDED ENGINEERING, Computer-aided design
(CAD).",
}
@Article{Gelder:1995:CCI,
author = "Allen Van Gelder and Jane Wilhelms",
title = "Corrigendum: ``{Topological Considerations in
Isosurface Generation}''",
journal = j-TOG,
volume = "14",
number = "3",
pages = "307--308",
month = jul,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Jan 13 12:33:38 1996",
note = "See \cite{Gelder:1994:TCI}.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/215264.html",
acknowledgement = ack-nhfb,
keywords = "algorithms; experimentation; performance; theory;
verification",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Boundary representations. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Curve, surface, solid,
and object representations. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Geometric algorithms,
languages, and systems.",
}
@Article{Glassner:1995:E,
author = "Andrew S. Glassner",
title = "Editorial",
journal = j-TOG,
volume = "14",
number = "4",
pages = "309--310",
month = oct,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Apr 05 05:31:00 1996",
acknowledgement = ack-nhfb,
}
@Article{Auslander:1995:FEC,
author = "Joel Auslander and Alex Fukunaga and Hadi Partovi and
Jon Christensen and Lloyd Hsu and Peter Reiss and
Andrew Shuman and Joe Marks and J. Thomas Ngo",
title = "Further Experience with Controller-Based Automatic
Motion Synthesis for Articulated Figures",
journal = j-TOG,
volume = "14",
number = "4",
pages = "311--336",
month = oct,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Apr 05 05:31:00 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/225295.html",
abstract = "We extend an earlier automatic motion-synthesis
algorithm for physically realistic articulated figures
in several ways. First, we summarize several
incremental improvements to the original algorithm that
improve its efficiency significantly and provide the
user with some ability to influence what motions are
generated. These techniques can be used by an animator
to achieve a desired movement style, or they can be
used to guarantee variety in the motions synthesized
over several runs of the algorithm. Second, we report
on new mechanisms that support the concatenation of
existing, automatically generated motion controllers to
produce complex, composite movement. Finally, we
describe initial work on generalizing the techniques
from 2D to 3D articulated figures. Taken together,
these results illustrate the promise and challenges
afforded by the controller-based approach to automatic
motion synthesis for computer animation.",
acknowledgement = ack-nhfb,
keywords = "algorithms; experimentation",
subject = "{\bf I.2.6}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Learning, Parameter learning. {\bf
I.2.8}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Problem Solving, Control Methods, and
Search, Heuristic methods. {\bf I.3.7}: Computing
Methodologies, COMPUTER GRAPHICS, Three-Dimensional
Graphics and Realism, Animation. {\bf I.6.3}: Computing
Methodologies, SIMULATION AND MODELING, Applications.",
}
@Article{Redner:1995:SBI,
author = "Richard A. Redner and Mark E. Lee and Samuel P.
Uselton",
title = "Smooth {B}-Spline Illumination Maps for Bidirectional
Ray Tracing",
journal = j-TOG,
volume = "14",
number = "4",
pages = "337--362",
month = oct,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Mon May 26 09:17:43 1997",
note = "Corrections to Figures 4--9 are available on the
World-Wide Web at
\path=http://www.acm.org/tog/AandE.html=.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/225296.html",
abstract = "In this paper we introduce B-spline illumination maps
and their generalizations and extensions for use in
realistic image generation algorithms. The B-spline
lighting functions (i.e., illumination maps) are
defined as weighted probability density functions. The
lighting functions can be estimated from random data
and may be used in bidirectional distributed ray
tracing programs as well as radiosity oriented
algorithms. The use of these lighting functions in a
bidirectional ray tracing system that can handle
dispersion as well as the focusing of light through
lenses is presented.",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Visible line/surface algorithms.",
}
@Article{deFloriani:1995:HTM,
author = "Leila de Floriani and Enrico Puppo",
title = "Hierarchical Triangulation for Multiresolution Surface
Description",
journal = j-TOG,
volume = "14",
number = "4",
pages = "363--411",
month = oct,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Apr 05 05:31:00 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/225297.html",
abstract = "A new hierarchical triangle-based model for
representing surfaces over sampled data is proposed,
which is based on the subdivision of the surface domain
into nested triangulations, called a {\em hierarchical
triangulation (HT)}. The model allows compression of
spatial data and representation of a surface at
successively finer degrees of resolution. An HT is a
collection of triangulations organized in a tree, where
each node, except for the root, is a triangulation
refining a face belonging to its parent in the
hierarchy. We present a topological model for
representing an HT, and algorithms for its construction
and for the extraction of a triangulation at a given
degree of resolution. The surface model, called a {\em
hierarchical triangulated surface (HTS)} is obtained by
associating data values with the vertices of triangles,
and by defining suitable functions that describe the
surface over each triangular patch. We consider an
application of a piecewise-linear version of the HTS to
interpolate topographical data, and we describe a
specialized version of the construction algorithm that
builds an HTS for a terrain starting from a
high-resolution rectangular grid of sampled data.
Finally, we present an algorithm for extracting
representations of terrain at variable resolution over
the domain.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations.",
}
@Article{Anonymous:1995:AI,
author = "Anonymous",
title = "1995 Author Index",
journal = j-TOG,
volume = "14",
number = "4",
pages = "412--413",
month = oct,
year = "1995",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Apr 05 05:31:00 1996",
acknowledgement = ack-nhfb,
}
@Article{Shirley:1996:MCT,
author = "Peter Shirley and Changyaw Wang and Kurt Zimmerman",
title = "{Monte Carlo} Techniques for Direct Lighting
Calculations",
journal = j-TOG,
volume = "15",
number = "1",
pages = "1--36",
month = jan,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Wed Apr 24 07:49:27 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/225887.html,
http://www.acm.org/pubs/toc/Abstracts/0730-0301/226151.html",
abstract = "In a distributed ray tracer, the sampling strategy is
the crucial part of the direct lighting calculation.
Monte Carlo integration with importance sampling is
used to carry out this calculation. Importance sampling
involves the design of integrand-specific probability
density functions that are used to generate sample
points for the numerical quadrature. Probability
density functions are presented that aid in the direct
lighting calculation from luminaires of various simple
shapes. A method for defining a probability density
function over a set of luminaires is presented that
allows the direct lighting calculation to be carried
out with a number of sample points that is independent
of the number of luminaires.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
STATISTICS. {\bf G.1.4}: Mathematics of Computing,
NUMERICAL ANALYSIS, Quadrature and Numerical
Differentiation. {\bf I.3.0}: Computing Methodologies,
COMPUTER GRAPHICS, General. {\bf I.4.1}: Computing
Methodologies, IMAGE PROCESSING, Digitization,
Sampling.",
}
@Article{Christensen:1996:GIG,
author = "Per H. Christensen and Eric J. Stollnitz and David H.
Salesin",
title = "Global Illumination of Glossy Environments Using
Wavelets and Importance",
journal = j-TOG,
volume = "15",
number = "1",
pages = "37--71",
month = jan,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Wed Apr 24 07:49:27 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/225888.html,
http://www.acm.org/pubs/toc/Abstracts/0730-0301/226153.html",
abstract = "We show how importance-driven refinement and a wavelet
basis can be combined to provide an efficient solution
to the global illumination problem with glossy and
diffuse reflections. Importance is used to focus the
computation on the interactions having the greatest
impact on the visible solution. Wavelets are used to
provide an efficient representation of radiance,
importance, and the transport operator. We discuss a
number of choices that must be made when constructing a
finite element algorithm for glossy global
illumination. Our algorithm is based on the standard
wavelet decomposition of the transport operator and
makes use of a four-dimensional wavelet representation
for spatially and angularly varying radiance
distributions. We use a final gathering step to improve
the visual quality of the solution. Features of our
implementation include support for curved surfaces as
well as texture-mapped anisotropic emission and
reflection functions.",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf G.1.9}: Mathematics of Computing, NUMERICAL
ANALYSIS, Integral Equations, Fredholm equations. {\bf
I.6.8}: Computing Methodologies, SIMULATION AND
MODELING, Types of Simulation, Combined. {\bf G.1.0}:
Mathematics of Computing, NUMERICAL ANALYSIS,
General.",
}
@Article{vanOverveld:1996:SSD,
author = "C. W. A. M. van Overveld and Marie Luce Viaud",
title = "Sticky Splines: Definition and Manipulation of Spline
Structures with Maintained Topological Relations",
journal = j-TOG,
volume = "15",
number = "1",
pages = "72--98",
month = jan,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Wed Apr 24 07:49:27 1996",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/225889.html,
http://www.acm.org/pubs/toc/Abstracts/0730-0301/226154.html",
abstract = "This paper describes an augmentation to the spline
concept to account for topological relations between
different spline curves. These topological relations
include incidence relations, constraining the extremes
of spline curves to other spline curves, and also more
general geometric relations, for example, involving the
tangents of spline curves in their extremes. To
maintain these incidence relations, some spline curves
may have to be transformed (translated, rotated,
scaled), or even deformed (i.e., the shape of the curve
may change) as a result of modifying other spline
curves. A data structure and algorithms are given to
implement the propagation of these transformations and
deformations.\par
Based on the augmented spline concept, to be called
{\em sticky splines}, both a script system to represent
spline structures and an interactive system for editing
drawings while automatically, maintaining their
topological structure are presented.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; experimentation; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Splines. {\bf I.6.1}: Computing Methodologies,
SIMULATION AND MODELING, Simulation Theory, Systems
theory. {\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism.",
}
@Article{Ezquerra:1996:APD,
author = "Norberto Ezquerra and Rakesh Mullick",
title = "An Approach to {3D} Pose Determination",
journal = j-TOG,
volume = "15",
number = "2",
pages = "99--120",
month = apr,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat May 25 07:25:30 1996",
acknowledgement = ack-nhfb,
}
@Article{Ware:1996:ESM,
author = "Colin Ware and Glenn Franck",
title = "Evaluating Stereo and Motion Cues for Visualizing
Information Nets in Three Dimensions",
journal = j-TOG,
volume = "15",
number = "2",
pages = "121--140",
month = apr,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat May 25 07:25:30 1996",
acknowledgement = ack-nhfb,
}
@Article{Bar-Yehuda:1996:TST,
author = "Rueven Bar-Yehuda and Craig Gotsman",
title = "Time\slash Space Tradeoffs for Polygon Mesh
Rendering",
journal = j-TOG,
volume = "15",
number = "2",
pages = "141--152",
month = apr,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat May 25 07:25:30 1996",
acknowledgement = ack-nhfb,
}
@Article{Luken:1996:CSD,
author = "William L. Luken and Fuhua (Frank) Cheng",
title = "Comparison of Surface and Derivative Evaluation
Methods for the Rendering of {NURB} Surfaces",
journal = j-TOG,
volume = "15",
number = "2",
pages = "153--178",
month = apr,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat May 25 07:25:30 1996",
acknowledgement = ack-nhfb,
}
@Article{Hubbard:1996:APS,
author = "Philip M. Hubbard",
title = "Approximating polyhedra with spheres for time-critical
collision detection",
journal = j-TOG,
volume = "15",
number = "3",
pages = "179--210",
month = jul,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Mon May 26 09:16:35 1997",
bibsource = "http://www.acm.org/pubs/toc/",
note = "MPEG animations showing the algorithm's performance
are available on the World-Wide Web at
\path=http://www.acm.org/tog/hubbard96/index.html=.",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/230518.html",
abstract = "This article presents a method for approximating
polyhedral objects to support a {\em time-critical}
collision-detection algorithm. The approximations are
hierarchies of spheres, and they allow the
time-critical algorithm to progressively refine the
accuracy of its detection, stopping as needed to
maintain the real-time performance essential for
interactive applications. The key to this approach is a
preprocess that automatically builds tightly fitting
hierarchies for rigid and articulated objects. The
preprocess uses {\em medial-axis surfaces}, which are
skeletal representations of objects. These skeletons
guide an optimization technique that gives the
hierarchies accuracy properties appropriate for
collision detection. In a sample application,
hierarchies build this way allow the time-critical
collision-detection algorithm to have acceptable
accuracy, improving significantly on that possible with
hierarchies built by previous techniques. The
performance of the time-critical algorithm in this
application is consistently 10 to 100 times better than
a previous collision-detection algorithm, maintaining
low latency and a nearly constant frame rate of 10
frames per second on a conventional graphics
workstation. The time-critical algorithm maintains its
real-time performance as objects become more
complicated, even as they exceed previously reported
complexity levels by a factor of more that 10.",
acknowledgement = ack-nhfb,
keywords = "algorithms; humanfactors; performance",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Object hierarchies. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Geometric algorithms,
languages, and systems. {\bf I.3.5}: Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Physically based
modeling. {\bf I.3.7}: Computing Methodologies,
COMPUTER GRAPHICS, Three-Dimensional Graphics and
Realism, Animation. {\bf I.3.7}: Computing
Methodologies, COMPUTER GRAPHICS, Three-Dimensional
Graphics and Realism, Virtual reality.",
}
@Article{Jeng:1996:MCP,
author = "Elvis Ko-Yung Jeng and Zhigang Xiang",
title = "Moving cursor plane for interactive sculpting",
journal = j-TOG,
volume = "15",
number = "3",
pages = "211--222",
month = jul,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 31 16:39:46 MDT 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/230523.html",
abstract = "Direct interactive manipulation of 3D objects is a
highly desirable but not yet fully realized feature
that can make the use of a modeling system more
intuitive and convenient. Two kinds of manipulation may
be identified: positioning and sculpting. {\em
Positioning} refers to the placement of objects in
relation to each other within a common scene. {\em
Sculpting} refers to the arbitrary deformation of
object shapes.\par
Ideally, we would like to be able to move objects
around easily as if they were held in our hands and to
reshape them freely as if they were made of clay.
However, realizing these goals of 3D editing on a
computer is very difficult, especially with an ordinary
display monitor. A fundamental problem is to provide
sufficient depth and shape cues for the user to
perceive the rendered objects and editing cursor in
such a way that positioning and sculpting operations
can be performed with reasonable flexibility and
accuracy.\par
Traditional CAD packages avoid true 3D editing by
restricting the controlled movement of the editing
cursor to two-dimensional. An arbitrary 3D location or
displacement has to be specified in consecutive steps
using separately projected views of the geometry. It is
conceivably more natural and productive to work in a
single display window. However, the challenge is to
include in the display meaningful and distinguishable
visual cues beyond such standard features as hidden
surface removal, surface lighting, and perspective
projection.",
acknowledgement = ack-nhfb,
keywords = "design; humanfactors",
subject = "{\bf I.3.6}: Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques, Interaction
techniques. {\bf D.2.2}: Software, SOFTWARE
ENGINEERING, Tools and Techniques, User interfaces.
{\bf H.5.2}: Information Systems, INFORMATION
INTERFACES AND PRESENTATION, User Interfaces,
Interaction styles. {\bf I.3.4}: Computing
Methodologies, COMPUTER GRAPHICS, Graphics Utilities,
Graphics editors.",
}
@Article{Fortune:1996:SAY,
author = "Steven Fortune and Christopher J. {Van Wyk}",
title = "Static analysis yields efficient exact integer
arithmetic for computational geometry",
journal = j-TOG,
volume = "15",
number = "3",
pages = "223--248",
month = jul,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 31 16:39:46 MDT 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/230533.html",
abstract = "Geometric algorithms as usually described assuming
that arithmetic operations are performed exactly on
real numbers. A program implemented using a naive
substitution of floating-point arithmetic for real
arithmetic can fail, since geometric primitives depend
upon sign-evaluation and may not be reliable if
evaluated approximately. Geometric primitives are
reliable if evaluated exactly with integer arithmetic,
but this degrades performance since software
extended-precision arithmetic is required.\par
We describe static-analysis techniques that reduce the
performance cost of exact integer arithmetic used to
implement geometric algorithms. We have used the
techniques for a number of examples, including
line-segment intersection in two dimensions, Delaunay
triangulations, and a tree-dimensional boundary-based
polyhedral modeler. In general, the techniques are
appropriate for algorithms that use primitives of
relatively low algebraic total degree, e.g., those
involving flat objects (points, lines, planes) in two
or three dimensions. The techniques have been package
in a preprocessor for reasonably convenient use.",
acknowledgement = ack-nhfb,
keywords = "algorithms; experimentation",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems. {\bf
D.3.4}: Software, PROGRAMMING LANGUAGES, Processors,
Preprocessors. {\bf G.4}: Mathematics of Computing,
MATHEMATICAL SOFTWARE, Efficiency. {\bf G.4}:
Mathematics of Computing, MATHEMATICAL SOFTWARE,
Reliability and robustness.",
}
@Article{Elber:1996:AIR,
author = "Gershon Elber and Elaine Cohen",
title = "Adaptive isocurve-based rendering for freeform
surfaces",
journal = j-TOG,
volume = "15",
number = "3",
pages = "249--263",
month = jul,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat Aug 31 16:39:46 MDT 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/230537.html",
abstract = "Freeform surface rendering is traditionally performed
by approximating the surface with polygons and then
rendering the polygons. This approach is extremely
common because of the complexity in accurately
rendering the surfaces directly. Recently several
papers presented methods that render surfaces as
sequences of isocurves. These methods each have
deficiencies in their ability to guarantee a complete
coverage of the rendered surface, in their ability to
prevent processing the same pixel multiple times, or in
their ability to produce an optimal surface coverage
under some prescribed norm. In this article, and
algorithm is introduced that alleviates the
difficulties in all these areas. This algorithm can be
combined with a fast curve-rendering method to make
surface rendering without polygonal approximation
practical.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Color, shading, shadowing, and texture. {\bf I.3.5}:
Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Curve,
surface, solid, and object representations. {\bf
I.3.5}: Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Splines.
{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Hidden line/surface removal.",
}
@Article{Chang:1996:IST,
author = "Meng-Chou Chang and Feipei Lai and Wei-Chao Chen",
title = "Image shaping taking into account relativistic
effects",
journal = j-TOG,
volume = "15",
number = "4",
pages = "265--300",
month = oct,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Mon Nov 11 16:14:40 MST 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/234537.html",
abstract = "This article is concerned with creating more realistic
images of 3D scenes which are moving relative to the
viewer at such high speeds that the propagation delay
of light signals and other relativistic effects can not
be neglected. Creating images of 3D scenes in
relativistic motion might have important applications
to science-fiction films, computer games, and virtual
environments. We shall discuss the following problems:
(1) how to determine the visual appearance of a rapidly
moving object, (2) how to determine the apparent
radiance of a scene point on a moving object, (3) how
to determine the incident irradiance at a scene point
coming from a moving light source, (4) how to determine
the color of a rapidly moving object, and (5) how to
generate shadows when there are relative motions
between the viewer, the scenes, and the light sources.
Detailed examples are also given to show the result of
shading with the relativistic effects taken into
account.",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Color, shading, shadowing, and texture. {\bf J.2}:
Computer Applications, PHYSICAL SCIENCES AND
ENGINEERING, Physics.",
}
@Article{Davidson:1996:DGN,
author = "Ron Davidson and David Harel",
title = "Drawing graphs nicely using simulated annealing",
journal = j-TOG,
volume = "15",
number = "4",
pages = "301--331",
month = oct,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Mon Nov 11 16:14:40 MST 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/234538.html",
abstract = "The paradigm of simulated annealing is applied to the
problem of drawing graphs ``nicely.'' Our algorithm
deals with general undirected graphs with straight-line
edges, and employs several simple criteria for the
aesthetic quality of the result. The algorithm is
flexible, in that the relative weights of the criteria
can be changed. For graphs of modest size it produces
good results, competitive with those produced by other
methods, notably, the ``spring method'' and its
variants.",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Computations on discrete
structures. {\bf G.2.2}: Mathematics of Computing,
DISCRETE MATHEMATICS, Graph Theory. {\bf D.0}:
Software, GENERAL. {\bf E.0}: Data, GENERAL.",
}
@Article{Guenter:1996:QPH,
author = "Brian Guenter and Jack Tumblin",
title = "Quadrature prefiltering for high quality
antialiasing",
journal = j-TOG,
volume = "15",
number = "4",
pages = "332--353",
month = oct,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Mon Nov 11 16:14:40 MST 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/234540.html",
abstract = "This article introduces quadrature prefiltering, an
accurate, efficient, and fairly simple algorithm for
prefiltering polygons for scanline rendering. It
renders very high quality images at reasonable cost,
strongly suppressing aliasing artifacts. For equivalent
RMS error, quadrature prefiltering is significantly
faster than either uniform or jittered supersampling.
Quadrature prefiltering is simple to implement and
space-efficient; it needs only a small two-dimensional
lookup table, even when computing nonradially symmetric
filter kernels. Previous algorithms have required
either three-dimensional tables or a restriction to
radially symmetric filter kernels. Though only slightly
more complicated to implement than the widely used box
prefiltering method, quadrature prefiltering can
generate images with much less visible aliasing
artifacts.",
acknowledgement = ack-nhfb,
keywords = "algorithms; performance; reliability",
subject = "{\bf I.3.3}: Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation.",
}
@Article{Dobkin:1996:CDA,
author = "David P. Dobkin and David Eppstein and Don P.
Mitchell",
title = "Computing the discrepancy with applications to
supersampling patterns",
journal = j-TOG,
volume = "15",
number = "4",
pages = "354--376",
month = oct,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Mon Nov 11 16:14:40 MST 1996",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/toc/Abstracts/0730-0301/234536.html",
abstract = "Patterns used for supersampling in graphics have been
analyzed from statistical and signal-processing
viewpoints. We present an analysis based on a type of
isotropic discrepancy---how good patterns are at
estimating the area in a region of defined type. We
present algorithms for computing discrepancy relative
to regions that are defined by rectangles, halfplanes,
and higher-dimensional figures. Experimental evidence
shows that popular supersampling patterns have
discrepancies with better asymptotic behavior than
random sampling, which is not inconsistent with
theoretical bounds on discrepancy.",
acknowledgement = ack-nhfb,
keywords = "algorithms; experimentation",
subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Geometrical problems and
computations. {\bf I.3.3}: Computing Methodologies,
COMPUTER GRAPHICS, Picture/Image Generation,
Antialiasing.",
}
@Article{Anonymous:1996:AI,
author = "Anonymous",
title = "1996 Author Index",
journal = j-TOG,
volume = "15",
number = "4",
pages = "377--378",
month = oct,
year = "1996",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Mon Nov 11 16:29:49 1996",
acknowledgement = ack-nhfb,
}
@Article{Glassner:1997:E,
author = "Andrew Glassner",
title = "Editorial",
journal = j-TOG,
volume = "16",
number = "1",
pages = "1--2",
month = jan,
year = "1997",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Mon Feb 24 11:25:57 1997",
acknowledgement = ack-nhfb,
}
@Article{Christensen:1997:CGG,
author = "Per H. Christensen and Dani Lischinski and Eric J.
Stollnitz and David H. Salesin",
title = "Clustering for Glossy Global Illumination",
journal = j-TOG,
volume = "16",
number = "1",
pages = "3--33",
month = jan,
year = "1997",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Mon Feb 24 11:25:57 1997",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1997-16-1/p3-christensen/",
abstract = "We present a new clustering algorithm for global
illumination in complex environments. The new algorithm
extends previous work on clustering for radiosity to
allow for nondiffuse (glossy) reflectors. We represent
clusters as points with directional distributions of
outgoing and incoming radiance and importance, and we
derive an error bound for transfers between these
clusters. The algorithm groups input surfaces into a
hierarchy of clusters, and then permits clusters to
interact only if the error bound is below an acceptable
tolerance. We show that the algorithm is asymptotically
more efficient than previous clustering algorithms even
when restricted to ideally diffuse environments.
Finally, we demonstrate the performance of our method
on two complex glossy environments.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Color, shading, shadowing, and texture.",
}
@Article{Lounsbery:1997:MAS,
author = "Michael Lounsbery and Tony D. DeRose and Joe Warren",
title = "Multiresolution Analysis for Surfaces of Arbitrary
Topological Type",
journal = j-TOG,
volume = "16",
number = "1",
pages = "34--73",
month = jan,
year = "1997",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1997-16-1/p34-lounsbery/",
abstract = "Multiresolution analysis and wavelets provide useful
and efficient tools for representing functions at
multiple levels of detail. Wavelet representations have
been used in a broad range of applications, including
image compression, physical simulation, and numerical
analysis. In this article, we present a new class of
wavelets, based on subdivision surfaces, that radically
extends the class of representable functions. Whereas
previous two-dimensional methods were restricted to
functions defined on ${\bf R}^2$, the subdivision
wavelets developed here may be applied to functions
defined on compact surfaces of arbitrary topological
type. We envision many applications of this work,
including continuous level-of-detail control for
graphics rendering, compression of geometric models,
and acceleration of global illumination algorithms.
Level-of-detail control for spherical domains is
illustrated using two examples: shape approximation of
a polyhedral model, and color approximation of global
terrain data.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
Approximation, Spline and piecewise polynomial
approximation. {\bf J.6}: Computer Applications,
COMPUTER-AIDED ENGINEERING, Computer-aided design
(CAD).",
}
@Article{Krishnan:1997:ESI,
author = "Shankar Krishnan and Dinesh Manocha",
title = "An Efficient Surface Intersection Algorithm Based on
Lower-Dimensional Formulation",
journal = j-TOG,
volume = "16",
number = "1",
pages = "74--106",
month = jan,
year = "1997",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Wed Feb 26 10:45:12 MST 1997",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1997-16-1/p74-krishnan/",
abstract = "We present an efficient algorithm to compute the
intersection of algebraic and NURBS surfaces. Our
approach is based on combining the marching methods
with the algebraic formulation. In particular, we
propose and matrix computations. We present algorithms
to compute a start point on each component of the
intersection curve (both open and closed components),
detect the presence of singularities, and find all the
curve branches near the singularity. We also suggest
methods to compute the step size during tracing to
prevent component jumping. The algorithm runs an order
of magnitude faster than previously published robust
algorithms. The complexity of the algorithm is output
sensitive.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
J.6}: Computer Applications, COMPUTER-AIDED
ENGINEERING.",
}
@Article{Hill:1997:CAQ,
author = "Bernhard Hill and Thomas Roger and Friedrich Wilhelm
Vorhagen",
title = "Comparative analysis of the quantization of color
spaces on the basis of the {CIELAB} color-difference
formula",
journal = j-TOG,
volume = "16",
number = "2",
pages = "109--154",
month = apr,
year = "1997",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Sep 26 10:17:27 1997",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1997-16-2/p109-hill/",
abstract = "This article discusses the CIELAB color space within
the limits of optimal colors including the complete
volume of object colors. A graphical representation of
this color space is composed of planes of constant
lightness $L*$ with an net of lines parallel to the
$a*$ and $b*$ axes. This uniform net is projected onto
a number of other color spaces (CIE XYZ, tristimulus
RGB, predistorted RGB, and YCC color space) to
demonstrate and study the structure of color
differences in these spaces on the basis of CIELAB
color difference formulas. Two formulas are considered:
the CIE 1976 formula *** and the newer CiE 1994 formula
***. The various color spaces considered are uniformly
quantized and the grid of quantized points is
transformed into CIELAB coordinates to study the
distribution of color differences due to basic
quantization steps and to specify the areas of the
colors with the highest sensitivity to color
discrimination. From a threshold value for the maximum
color difference among neighboring quantized points
searched for in each color space, concepts for the
quantization of the color spaces are derived. The
results are compared to quantization concepts based on
average values of quantization errors published in
previous work. In addition to color spaces bounded by
the optimal colors, the studies are also applied to
device-dependent color spaces limited by the range of a
positive RGB cube or by the gamut of colors of
practical print processes (thermal dye sublimation,
chromalin, and match print). For all the color spaces,
estimation of the number of distinguishable colors are
given on the basis of a threshold value for the color
difference perception of *** = 1 and *** = 1.",
acknowledgement = ack-nhfb,
keywords = "algorithms; experimentation; performance;
standardization; theory",
subject = "{\bf I.3.7}: Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Color, shading, shadowing, and texture. {\bf I.4.1}:
Computing Methodologies, IMAGE PROCESSING,
Digitization, Quantization. {\bf G.1.2}: Mathematics of
Computing, NUMERICAL ANALYSIS, Approximation. {\bf
I.3.1}: Computing Methodologies, COMPUTER GRAPHICS,
Hardware architecture, Hardcopy devices. {\bf I.3.3}:
Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation, Display algorithms.",
}
@Article{Liu:1997:OAE,
author = "Wayne Liu and Stephen Mann",
title = "An Optimal Algorithm for Expanding the Composition of
Polynomials",
journal = j-TOG,
volume = "16",
number = "2",
pages = "155--178",
month = apr,
year = "1997",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Mon May 26 09:24:06 MDT 1997",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1997-16-2/p155-liu/",
abstract = "A runtime analysis is made of a previously published
algorithm for polynomial composition. The relationship
between this composition algorithm and
Sablonni{\`e}re's algorithm is explored. This
composition algorithm is then made optimal aby first
performing a change of basis.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; performance",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on polynomials. {\bf J.6}:
Computer Applications, COMPUTER-AIDED ENGINEERING,
Computer-aided design (CAD).",
}
@Article{Fudos:1997:GCA,
author = "Ioannis Fudos and Christoph M. Hoffmann",
title = "A Graph-constructive Approach to Solving Systems of
Geometric Constraints",
journal = j-TOG,
volume = "16",
number = "2",
pages = "179--216",
month = apr,
year = "1997",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Mon May 26 09:24:06 MDT 1997",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1997-16-2/p179-fudos/",
abstract = "A graph-constructive approach to solving systems of
geometric constraints capable of efficiently handling
well-constrained, overconstrained, and underconstrained
configurations is presented. The geometric constraint
solver works in two phases: in the analysis phase the
constraint graph is analyzed and a sequence of
elementary construction steps is derived, and then in
the construction phase the sequence of construction
steps in actually carried out. The analysis phase of
the algorithm is described in detail, its correctness
is proved, and an efficient algorithm to realized it is
presented. The scope of the graph analysis is then
extended by utilizing semantic information in the form
of angle derivations, and by extending the repertoire
of the construction steps. Finally, the construction
phase is briefly discussed.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; performance; theory",
subject = "{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems. {\bf
G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Graph algorithms. {\bf I.1.0}: Computing
Methodologies, ALGEBRAIC MANIPULATION, General. {\bf
I.3.6}: Computing Methodologies, COMPUTER GRAPHICS,
Methodology and Techniques. {\bf J.6}: Computer
Applications, COMPUTER-AIDED ENGINEERING,
Computer-aided design (CAD).",
}
@Article{Walter:1997:GIU,
author = "Bruce Walter and Philip M. Hubbard and Peter Shirley
and Donald P. Greenberg",
title = "Global illumination using local linear density
estimation",
journal = j-TOG,
volume = "16",
number = "3",
pages = "217--259",
month = jul,
year = "1997",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Wed Sep 24 17:29:18 MDT 1997",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1997-16-3/p217-walter/",
abstract = "This article presents the density estimation framework
for generating view-independent global illumination
solutions. It works by probabilistically simulating the
light flow in an environment with light particles that
trace random walks originating at luminaires and then
using statistical density estimation techniques to
reconstruct the lighting on each surface. By splitting
the computation into separate transport and
reconstruction stages, we gain many advantages
including reduced memory usage, the ability to simulate
nondiffuse transport, and natural parallelism.
Solutions to several theoretical and practical
difficulties in implementing this framework are also
described. Light sources that vary spectrally and
directionally are integrated into a spectral particle
tracer using nonuniform rejection. A new local linear
density estimation technique eliminates boundary bias
and extends to arbitrary polygons. A mesh decimation
algorithm with perceptual calibration is introduced to
simplify the Gouraud shaded representation of the
solution for interactive display.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf I.3.6} Computing Methodologies, COMPUTER
GRAPHICS, Methodology and Techniques. {\bf I.1.2}
Computing Methodologies, ALGEBRAIC MANIPULATION,
Algorithms, Analysis of algorithms. {\bf G.1.8}
Mathematics of Computing, NUMERICAL ANALYSIS, Partial
Differential Equations, Finite element methods",
}
@Article{Xiang:1997:CIQ,
author = "Zhigang Xiang",
title = "Color image quantization by minimizing the maximum
intercluster distance",
journal = j-TOG,
volume = "16",
number = "3",
pages = "260--276",
month = jul,
year = "1997",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Wed Sep 24 17:29:18 MDT 1997",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1997-16-3/p260-xiang/",
abstract = "One of the numerical criteria for color image
quantization is to minimize the maximum discrepancy
between original pixel colors and the corresponding
quantized colors. This is typically carried out by
first grouping color points into tight clusters and
then finding a representative for each cluster. In this
article we show that getting the smallest clusters
under a formal notion of minimizing the maximum
intercluster distance does not guarantee an optimal
solution for the quantization criterion. Nevertheless,
our use of an efficient clustering algorithm by Teofilo
F. Gonzalez, which is optimal with respect to the
approximation bound of the clustering problem, has
resulted in a fast and effective quantizer. This new
quantizer is highly competitive and excels when
quantization errors need to be well capped and when the
performance of other quantizers may be hindered by such
factors as low number of quantized colors or
unfavorable pixel population distribution. Both
computer-synthesized and photographic images are used
in experimental comparison with several existing
quantization methods.",
acknowledgement = ack-nhfb,
keywords = "design; experimentation; measurement; performance;
theory",
subject = "{\bf I.3.3} Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.4.1} Computing Methodologies, IMAGE PROCESSING,
Digitization, Quantization. {\bf I.3.7} Computing
Methodologies, COMPUTER GRAPHICS, Three-Dimensional
Graphics and Realism, Color, shading, shadowing, and
texture",
}
@Article{Park:1997:SII,
author = "F. C. Park and Bahram Ravani",
title = "Smooth invariant interpolation of rotations",
journal = j-TOG,
volume = "16",
number = "3",
pages = "277--295",
month = jul,
year = "1997",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Wed Sep 24 17:29:18 MDT 1997",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1997-16-3/p277-park/",
abstract = "We present an algorithm for generating a
twice-differentiable curve on the rotation group SO(3)
that interpolates a given ordered set of rotation
matrices at their specified knot times. In our approach
we regard SO(3) as a Lie group with a bi-invariant
Riemannian metric, and apply the coordinate-invariant
methods of Riemannian geometry. The resulting rotation
curve is easy to compute, invariant with respect to
fixed and moving reference frames, and also
approximately minimizes angular acceleration",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf G.1.1} Mathematics of Computing, NUMERICAL
ANALYSIS, Interpolation, Spline and piecewise
polynomial interpolation. {\bf I.3.7} Computing
Methodologies, COMPUTER GRAPHICS, Three-Dimensional
Graphics and Realism, Animation. {\bf I.3.5} Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Geometric algorithms,
languages, and systems",
}
@Article{Castillo:1997:SCF,
author = "Enrique Castillo and Andr{\'e}s Iglesias",
title = "Some characterizations of families of surfaces using
functional equations",
journal = j-TOG,
volume = "16",
number = "3",
pages = "296--318",
month = jul,
year = "1997",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Wed Sep 24 17:29:18 MDT 1997",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1997-16-3/p296-castillo/",
abstract = "In this article functional equations are used to
characterize some families of surfaces. First, the most
general surfaces in implicit form $f(x,y,z) = 0$, such
that any arbitrary intersection with the planes $z =
z0$, $y = y0$, and $x = x0$ are linear combinations of
sets of functions of the other two variables, are
characterized. It is shown that only linear
combinations of tensor products of univariate functions
are possible for $f(x,y,z)$. Second, we obtain the most
general families of surfaces in explicit form such that
their intersections with planes parallel to the planes
$y = 0$ and $x = 0$ belong to two, not necessarily
equal, parametric families of curves. Finally,
functional equations are used to analyze the uniqueness
of representation of Gordon-Coons surfaces. Some
practical examples are used to illustrate the
theoretical results.",
acknowledgement = ack-nhfb,
keywords = "design; measurement; performance; theory;
verification",
subject = "{\bf I.3.5} Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations",
}
@Article{Sanchez-Reyes:1997:SAP,
author = "J. S{\'a}nchez-Reyes",
title = "The symmetric analogue of the polynomial power basis",
journal = j-TOG,
volume = "16",
number = "3",
pages = "319--357",
month = jul,
year = "1997",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Sep 26 10:19:42 1997",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1997-16-3/p319-sanchez-reyes/",
abstract = "A new polynomial basis over the unit interval $t \in
[0,1]$ is proposed. The work is motivated by the fact
that the monomial (power) form is not suitable in CAGD,
as it suffers from serious numerical problems, and the
monomial coefficients have no geometric meaning. The
new form is the symmetric analogue of the power form,
because it can be regarded as an ``Hermite two-point
expansion'' instead of a Taylor expansion. This form
enjoys good numerical properties and admits a
Horner-like evaluation algorithm that is almost as fast
as that of the power form. In addition, the symmetric
power coefficients convey a geometric meaning, and
therefore they can be used as shape handles. A
polynomial expressed in the symmetric power basis is
decomposed into linear, cubic quintic, and successive
components. In consequence, this basis is bbetter
suited to handle polynomials of different degrees than
the Bernstein basis, and those algorithms involving
degree operations have extremely simple formulations.
The minimum degree of a polynomial is immediately
obtained by inspecting its coefficients. Degree
reduction of a curve or surface reduces to dropping the
desired high degree terms",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; measurement; performance; theory",
subject = "{\bf G.1.0} Mathematics of Computing, NUMERICAL
ANALYSIS, General, Error analysis. {\bf G.1.1}
Mathematics of Computing, NUMERICAL ANALYSIS,
Interpolation. {\bf I.3.5} Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Curve, surface, solid, and object
representations. {\bf J.6} Computer Applications,
COMPUTER-AIDED ENGINEERING. {\bf F.2.1} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computations on matrices",
}
@Article{Yun:1997:LCC,
author = "Hee Cheol Yun and Brian K. Guenter and Russell M.
Mersereau",
title = "Lossless compression of computer generated animation
frames",
journal = j-TOG,
volume = "16",
number = "4",
pages = "359--396",
month = oct,
year = "1997",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Wed Nov 26 06:52:24 MST 1997",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/journals/tog/1997-16-4/p359-yun/",
abstract = "This article presents a new lossless compression
algorithm for computer animation image sequences. The
algorithm uses transformation information available in
the animation script and floating point depth and
object number information at each pixel to perform
highly accurate motion prediction with vary low
computation. The geometric data (i.e., the depth and
object number) can either be computed during the
original rendering process and stored with the image or
computed on the fly during compression and
decompression. In the former case the stored geometric
data are very efficiently compressed using motion
prediction and a new technique called direction coding,
typically to 1 to 2 bits per pixel. The geometric data
are also useful in z-buffer image compositing and this
new compression algorithm offers a very low storage
overhead method for saving the information needed for
this compositing. The overall compression ratio of the
new algorithm, including the geometric data overhead,
in compared to conventional spatial linear prediction
compression and block-matching motion. The algorithm
improves on a previous motion prediction algorithm by
incorporating block predictor switching and color ratio
prediction. The combination of these techniques gives
compression ratios 30\% better than those reported
previously.",
acknowledgement = ack-nhfb,
keywords = "algorithms; measurement",
subject = "{\bf I.4.2} Computing Methodologies, IMAGE PROCESSING
AND COMPUTER VISION, Compression (Coding), Exact
coding**.",
}
@Article{Overveld:1997:PNI,
author = "C. W. A. M. Van Overveld and B. Wyvill",
title = "{Phong} normal interpolation revisited",
journal = j-TOG,
volume = "16",
number = "4",
pages = "397--419",
month = oct,
year = "1997",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Wed Nov 26 06:52:24 MST 1997",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/journals/tog/1997-16-4/p397-van_overveld/",
abstract = "Phong shading is one of the best known, and at the
same time simplest techniques to arrive at realistic
images when rendering 3D geometric models. However,
despite (or maybe due to) its success and its
widespread use, some aspects remain to be clarified
with respect to its validity and robustness. This might
be caused by the fact that the Phong method is based on
geometric arguments, illumination models, and clever
heuristics. In this article we address some of the
fundamentals that underlie Phong shading, such as the
computation of vertex normals for nonmanifold models
and the adequacy of linear interpolation and we apply a
new interpolation technique to achieve an efficient and
qualitatively improve result.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.3.7} Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Color, shading, shadowing, and texture.",
}
@Article{Peters:1997:SSS,
author = "J{\"o}rg Peters and Ulrich Reif",
title = "The simplest subdivision scheme for smoothing
polyhedra",
journal = j-TOG,
volume = "16",
number = "4",
pages = "420--431",
month = oct,
year = "1997",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Wed Nov 26 06:52:24 MST 1997",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/journals/tog/1997-16-4/p420-peters/",
abstract = "Given a polyhedron, construct a new polyhedron by
connecting every edge-midpoint to its four neighboring
edge-midpoints. This refinement rule yields a {\em
C\/}1 surface and the surface has a piecewise quadratic
parametrization except at a finite number of isolated
points. We analyze and improve the construction.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
subject = "{\bf I.3.3} Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.5} Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Curve,
surface, solid, and object representations. {\bf I.3.5}
Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Geometric
algorithms, languages, and systems.",
}
@Article{Bajaj:1998:RPN,
author = "Chandrajit L. Bajaj and Robert L. Holt and Arun N.
Netravali",
title = "Rational Parametrizations of Nonsingular Real Cubic
Surfaces",
journal = j-TOG,
volume = "17",
number = "1",
pages = "1--31",
month = jan,
year = "1998",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat May 16 07:25:59 MDT 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/journals/tog/1998-17-1/p1-bajaj/",
abstract = "Real cubic algebraic surfaces may be described by
either implicit or parametric equations. One
particularly useful representation is the rational
parametrization, where the three spatial coordinates
are given by rational functions of two parameters.
These parametrizations take on different forms for
different classes of cubic surfaces. Classification of
real cubic algebraic surfaces into five families for
the nonsingular case is based on the configuration of
27 lines on them. We provide a method of extracting all
these lines by constructing and solving a polynomial of
degree 27. Simple roots of this polynomial correspond
to real lines on the surface, and real skew lines are
used to form rational parametrizations for three of
these families. Complex conjugate skew lines are used
to parametrize surfaces from the fourth family. The
parametrizations for these four families involve
quotients of polynomials of degree no higher than four.
Each of these parametrizations covers the whole surface
except for a few points, lines, or conic sections. The
parametrization for the fifth family, as noted
previously in the literature, requires a square root.
We also analyze the image of the derived rational
parametrization for both real and complex parameter
values, together with ``base'' points where the
parametrizations are ill-defined.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.1.2} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Algorithms. {\bf F.2.1} Theory
of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems.",
xxauthor = "Chandrajit L. Bajaj and Robert J. Holt and Arun N.
Netravali",
}
@Article{Elber:1998:BSR,
author = "Gershon Elber and Myung-Soo Kim",
title = "The Bisector Surface of Rational Space Curves",
journal = j-TOG,
volume = "17",
number = "1",
pages = "32--49",
month = jan,
year = "1998",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat May 16 07:25:59 MDT 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/journals/tog/1998-17-1/p32-elber/",
abstract = "Given a point and a rational curve in the plane, their
bisector curve is rational [Farouki and Johnston
1994a]. However, in general, the bisector of two
rational curves in the plane is not rational [Farouki
and Johnstone 1994b]. Given a point and a rational {\em
space\/} curve, this art icle shows that the bisector
surface is a rational ruled surface. Moreover, given
two rational space curves, we show that the bisector
surface is rational (except for the degenerate case in
which the two curves are coplanar).",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf I.3.5} Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling.",
}
@Article{Paglieroni:1998:DPP,
author = "David W. Paglieroni",
title = "The Directional Parameter Plane Transform of a Height
Field",
journal = j-TOG,
volume = "17",
number = "1",
pages = "50--70",
month = jan,
year = "1998",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat May 16 07:25:59 MDT 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/journals/tog/1998-17-1/p50-paglieroni/",
abstract = "The linear {\em Parameter Plane Transform (PPT)\/} of
a height field attributes an inverted cone of empty
space to each height field cell. In is known that
height field ray-tracing efficiency can be improved by
traversing rays in steps across inverted cones of empty
space. However, steps across inverted cones of empty
space along rays close to the base of a steep ridge
will be short, even if there are no obstructions along
the line of sight, because the cones will be narrow.
This weakness can be virtually eliminated by allowing
the opening angles of the inverted cones of empty space
to vary between sectors, i.e., by directionalizing the
linear PPT. An efficient algorithm for computing the
linear directional PPT of a height field is given and
its properties are investigated.",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf I.3.7} Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Raytracing. {\bf I.3.3} Computing Methodologies,
COMPUTER GRAPHICS, Picture/Image Generation, Display
algorithms. {\bf I.3.3} Computing Methodologies,
COMPUTER GRAPHICS, Picture/Image Generation, Viewing
algorithms.",
}
@Article{Greiner:1998:ECA,
author = "G{\"u}nther Greiner and Kai Hormann",
title = "Efficient clipping of arbitrary polygons",
journal = j-TOG,
volume = "17",
number = "2",
pages = "71--83",
month = apr,
year = "1998",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat May 16 07:25:59 MDT 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/journals/tog/1998-17-2/p71-greiner/",
abstract = "Clipping 2D polygons is one of the basic routines in
computer graphics. In rendering complex 3D images it
has to be done several thousand times. Efficient
algorithms are therefore very important. We present
such an efficient algorithm for clipping arbitrary
2D-polygons. The algorithm can handle arbitrary closed
polygons, specifically where the clip and subject
polygons may self-intersect. The algorithm is simple
and faster that Vatti's (1992) algorithm, which was
designed for the general case as well. Simple
modifications allow determination of union and
set-theoretic differences of two arbitrary polygons.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.3.3} Computing Methodologies, COMPUTER
GRAPHICS, Picture/Image Generation, Display algorithms.
{\bf I.3.5} Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling.",
}
@Article{Taubin:1998:GCT,
author = "Gabriel Taubin and Jarek Rossignac",
title = "Geometric compression through topological surgery",
journal = j-TOG,
volume = "17",
number = "2",
pages = "84--115",
month = apr,
year = "1998",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat May 16 07:25:59 MDT 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/journals/tog/1998-17-2/p84-taubin/",
abstract = "The abundance and importance of complex 3-D data bases
in major industry segments, the affordability of
interactive 3-D rendering for office and consumer use,
and the exploitation of the Internet to distribute and
share 3-D data have intensified the need for an
effective 3-D geometric compression technique that
would significantly reduce the time required to
transmit 3-D models over digital communication
channels, and the amount of memory or disk space
required to store the models. Because the prevalent
representation of 3-D models for graphics purposes is
polyhedral and because polyhedral models are in general
triangulated for rendering, this article introduces a
new compressed representation for complex triangulated
models and simple, yet efficient, compression and
decompression algorithms. In this scheme, vertex
positions are quantized within the desired accuracy, a
vertex spanning tree is used to predict the position of
each vertex from 2,3, or 4 of its ancestors in the
tree, and the correction vectors are entropy encoded.
Properties, such as normals, colors, and texture
coordinates, are compressed in a similar manner. The
connectivity is encoded with no loss of information to
an average of less than two bits per triangle. The
vertex spanning tree and a small set of jump edges are
used to split the model into a simple polygon. A
triangle spanning tree and a sequence of marching bits
are used to encode the triangulation of the polygon.
Our approach improves on Michael Deering's pioneering
results by exploiting the geometric coherence of
several ancestors in the vertex spanning tree,
preserving the connectivity with no loss of
information, avoiding vertex repetitions, and using
about three fewer bits for the connectivity. However,
since decompression requires random access to all
vertices, this method must be modified for hardware
rendering with limited onboard memory. Finally, we
demonstrate implementation results for a variety of
VRML models with up to two orders of magnitude
compression.",
acknowledgement = ack-nhfb,
keywords = "algorithms; standardization",
subject = "{\bf I.3.5} Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations.",
}
@Article{Cohen-Or:1998:TDD,
author = "Daniel Cohen-Or and Amira Solomovic and David Levin",
title = "Three-dimensional distance field metamorphosis",
journal = j-TOG,
volume = "17",
number = "2",
pages = "116--141",
month = apr,
year = "1998",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Sat May 16 07:25:59 MDT 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/journals/tog/1998-17-2/p116-cohen-or/",
abstract = "Given two or more objects of general topology,
intermediate objects are constructed by a distance
field metamorphosis. In the presented method the
interpolation of the distance field is guided by a warp
function controlled by a set of corresponding anchor
points. Some rules for defining a smooth
least-distorting warp function are given. To reduce the
distortion of the intermediate shapes, the warp
function is decomposed into a rigid rotational part and
an elastic part. The distance field interpolation
method is modified so that the interpolation is done in
correlation with the warp function. The method provides
the animator with a technique that can be used to
create a set of models forming a smooth transition
between pairs of a given sequence of keyframe models.
The advantage of the new approach is that it is capable
of morphing between objects having a different
topological genus where no correspondence between the
geometric primitives of the models needs to be
established. The desired correspondence is defined by
an animator in terms of a relatively small number of
anchor points",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.3.7} Computing Methodologies, COMPUTER
GRAPHICS, Three-Dimensional Graphics and Realism,
Animation. {\bf I.3.5} Computing Methodologies,
COMPUTER GRAPHICS, Computational Geometry and Object
Modeling, Curve, surface, solid, and object
representations. {\bf I.3.6} Computing Methodologies,
COMPUTER GRAPHICS, Methodology and Techniques,
Interaction techniques.",
}
@Article{Gonzalez-Ochoa:1998:CMO,
author = "Carlos Gonzalez-Ochoa and Scott McCammon and J{\"o}rg
Peters",
title = "Computing moments of objects enclosed by piecewise
polynomial surfaces",
journal = j-TOG,
volume = "17",
number = "3",
pages = "143--157",
month = jul,
year = "1998",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Oct 16 16:30:05 MDT 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1998-17-3/p143-gonzalez-ochoa/",
abstract = "Combining a polynomial free-form surface
representation with Gauss' divergence theorem allows
efficient and exact calculation of the moments of the
enclosed objects. For example, for an cubic
representation, volume, center of mass, and the inertia
tensor can be computed in seconds even for complex
objects with several thousand patches while change due
to local modification of the surface geometry can be
computed in real-time as feedback for animation or
design. Speed and simplicity of the approach allow
solving the inverse problem of modeling to match
prescribed moments.",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
subject = "{\bf I.3.5} Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Curve, surface, solid, and object representations. {\bf
G.1.4} Mathematics of Computing, NUMERICAL ANALYSIS,
Quadrature and Numerical Differentiation,
Multidimensional (multiple) quadrature.",
}
@Article{Heidrich:1998:SPS,
author = "Wolfgang Heidrich and Philip Slusallek and Hans-Peter
Seidel",
title = "Sampling procedural shaders using affine arithmetic",
journal = j-TOG,
volume = "17",
number = "3",
pages = "158--176",
month = jul,
year = "1998",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Oct 16 16:30:05 MDT 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1998-17-3/p158-heidrich/",
abstract = "Procedural shaders have become popular tools for
describing surface reflectance functions and other
material properties. In comparison to fixed resolution
textures, they have the advantage of being
resolution-independent and storage-efficient.\par While
procedural shaders provide an interface for evaluating
the shader at a single point, it is not easily possible
to obtain an average value of the shader together with
accurate error bounds over a finite area. Yet the
ability to compute such error bounds is crucial for
several interesting applications, most notably
hierarchical area sampling for global illumination,
using the finite element approach, and for generation
of textures used in interactive computer graphics.\par
Using affine arithmetic for evaluating the shader over
a finite area yields a tight, conservative error
interval for the shader function. Compilers can
automatically generate code for utilizing affine
arithmetic from within shaders implemented in a
dedicated language such as the RenderMan shading
language.",
acknowledgement = ack-nhfb,
keywords = "experimentation; performance; theory; verification",
subject = "{\bf I.4.7} Computing Methodologies, IMAGE PROCESSING
AND COMPUTER VISION, Feature Measurement, Texture. {\bf
G.1.0} Mathematics of Computing, NUMERICAL ANALYSIS,
General, Error analysis. {\bf G.1.0} Mathematics of
Computing, NUMERICAL ANALYSIS, General, Interval
arithmetic. {\bf G.1.4} Mathematics of Computing,
NUMERICAL ANALYSIS, Quadrature and Numerical
Differentiation, Automatic differentiation. {\bf I.3.7}
Computing Methodologies, COMPUTER GRAPHICS,
Three-Dimensional Graphics and Realism, Color, shading,
shadowing, and texture. {\bf I.4.1} Computing
Methodologies, IMAGE PROCESSING AND COMPUTER VISION,
Digitization and Image Capture, Sampling.",
}
@Article{Mirtich:1998:VFR,
author = "Brian Mirtich",
title = "{V-Clip}: fast and robust polyhedral collision
detection",
journal = j-TOG,
volume = "17",
number = "3",
pages = "177--208",
month = jul,
year = "1998",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Oct 16 16:30:05 MDT 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1998-17-3/p177-mirtich/",
abstract = "This article presents the Voronoi-clip, or V-Clip,
collision detection algorithm for polyhedral objects
specified by a boundary representation. V-Clip tracks
the closest pair of features between convex polyhedra,
using an approach reminiscent of the Lin-Canny closest
features algorithm. V-Clip is an improvement over the
latter in several respects. Coding complexity is
reduced, and robustness is significantly improved; the
implementation has no numerical tolerances and does not
exhibit cycling problems. The algorithm also handles
penetrating polyhedra, and can therefore be used to
detect collisions between nonconvex polyhedra described
as hierarchies of convex pieces. The article presents
the theoretical principles of V-Clip, and gives a
pseudocode description of the algorithm. It also
documents various test that compare V-Clip, Lin-Canny,
and the Enhanced GJK algorithm, a simplex-based
algorithm that is widely used for the same application.
The results show V-Clip to be a strong contender in
this field, comparing favorably with the other
algorithms in most of the tests, in term of both
performance and robustness.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.3.5} Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems. {\bf
I.3.5} Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Boundary
representations.",
}
@Article{Kobbelt:1998:MFV,
author = "Leif Kobbelt and Peter Schr{\"o}der",
title = "A multiresolution framework for variational
subdivision",
journal = j-TOG,
volume = "17",
number = "4",
pages = "209--237",
month = oct,
year = "1998",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Feb 19 08:20:08 MST 1999",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1998-17-4/p209-kobbelt/",
abstract = "Subdivision is a powerful paradigm for the generation
of curves and surfaces. It is easy to implement,
computationally efficient, and useful in a variety of
applications because of its intimate connection with
multiresolution analysis. An important task in computer
graphics and geometric modeling is the construction of
curves that interpolate a given set of points and
minimize a fairness functional (variational design). In
the context of subdivision, fairing leads to special
schemes requiring the solution of a banded linear
system at every subdivision step. We present several
examples of such schemes including one that reproduces
nonuniform interpolating cubic splines. Expressing the
construction in terms of certain elementary operations
we are able to embed variational subdivision in the
lifting framework, a powerful technique to construct
wavelet filter banks given a subdivision scheme. This
allows us to extend the traditional lifting scheme for
FIR filters to a certain class of IIR filters.
Consequently, we how how to build variationally optimal
curves {\em and\/} associated, stable wavelets in a
straightforward fashion. The algorithms to perform the
corresponding decomposition and reconstruction
transformations are easy to implement and efficient
enough for interactive applications.",
acknowledgement = ack-nhfb,
keywords = "design",
subject = "{\bf G.1.1} Mathematics of Computing, NUMERICAL
ANALYSIS, Interpolation, Spline and piecewise
polynomial interpolation. {\bf G.1.2} Mathematics of
Computing, NUMERICAL ANALYSIS, Approximation, Spline
and piecewise polynomial approximation. {\bf G.1.2}
Mathematics of Computing, NUMERICAL ANALYSIS,
Approximation, Wavelets and fractals. {\bf I.3.3}
Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation, Line and curve generation.
{\bf I.3.5} Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Splines.",
}
@Article{Naiman:1998:JEW,
author = "Avi C. Naiman",
title = "Jagged edges: when is filtering needed?",
journal = j-TOG,
volume = "17",
number = "4",
pages = "238--258",
month = oct,
year = "1998",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Feb 19 08:20:08 MST 1999",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1998-17-4/p238-naiman/",
abstract = "Depiction of oblique edges by discrete pixels usually
results in visible stair steps, often called {\em
jaggies\/}. A variety of filtering approaches exists to
minimize this visual artifact, but none has been
applied selectively only to those edges that would
otherwise appear jagged. A recent series of experiments
has led to a model of the visibility of jagged edges.
Here, we demonstrate how these data can be used
efficiently to determine when filtering of edges is
needed to eliminate the jaggies and when it is
unnecessary. This work also provides a template for how
the results of psychophysical experiments can be
applied in computer graphics to address image-quality
questions.",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf I.4.3} Computing Methodologies, IMAGE PROCESSING
AND COMPUTER VISION, Enhancement, Filtering. {\bf
I.4.3} Computing Methodologies, IMAGE PROCESSING AND
COMPUTER VISION, Enhancement, Smoothing. {\bf I.3.0}
Computing Methodologies, COMPUTER GRAPHICS, General.
{\bf I.3.3} Computing Methodologies, COMPUTER GRAPHICS,
Picture/Image Generation.",
}
@Article{Raghothama:1998:BRD,
author = "Srinivas Raghothama and Vadim Shapiro",
title = "Boundary representation deformation in parametric
solid modeling",
journal = j-TOG,
volume = "17",
number = "4",
pages = "259--286",
month = oct,
year = "1998",
CODEN = "ATGRDF",
ISSN = "0730-0301",
bibdate = "Fri Feb 19 08:20:08 MST 1999",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org/pubs/citations/journals/tog/1998-17-4/p259-raghothama/",
abstract = "One of the major unsolved problems in parametric solid
modeling is a robust update (regeneration) of the
solid's boundary representation, given a specified
change in the solid's parameter values. The fundamental
difficulty lies in determining the mapping between
boundary representations for solids in the same
parametric family. Several heuristic approaches have
been proposed for dealing with this problem, but the
formal properties of such mappings are not well
understood. We propose a formal definition for boundary
representation. (BR-)deformation for solids in the same
parametric family, based on the assumption of
continuity: small changes in solid parameter values
should result in small changes in the solid's boundary
representation, which may include local collapses of
cells in the boundary representation. The necessary
conditions that must be satisfied by any BR-deforming
mappings between boundary representations are powerful
enough to identify invalid updates in many (but not
all) practical situations, and the algorithms to check
them are simple. Our formulation provides a formal
criterion for the recently proposed heuristic
approaches to ``persistent naming,'' and explains the
difficulties in devising sufficient tests for
BR-deformation encountered in practice. Finally our
methods are also applicable to more general cellular
models of pointsets and should be useful in developing
universal standards in parametric modeling.",
acknowledgement = ack-nhfb,
keywords = "algorithms; reliability; standardization; theory",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Geometrical problems and
computations. {\bf G.2.1} Mathematics of Computing,
DISCRETE MATHEMATICS, Combinatorics, Combinatorial
algorithms. {\bf H.5.2} Information Systems,
INFORMATION INTERFACES AND PRESENTATION, User
Interfaces, Interaction styles. {\bf I.1.2} Computing
Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION,
Algorithms, Algebraic algorithms. {\bf I.3.5} Computing
Methodologies, COMPUTER GRAPHICS, Computational
Geometry and Object Modeling, Boundary representations.
{\bf J.6} Computer Applications, COMPUTER-AIDED
ENGINEERING, Computer-aided design (CAD).",
}
@Article{Dana:1999:RTR,
author = "Kristin J. Dana and Bram van Ginneken and Shree K.
Nayar and Jan J. Koenderink",
title = "Reflectance and texture of real-world surfaces",
journal = j-TOG,
volume = "18",
number = "1",
pages = "1--34",
month = jan,
year = "1999",
bibdate = "Fri Jun 4 06:15:34 MDT 1999",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/journals/tog/1999-18-1/p1-dana/",
abstract = "In this work, we investigate the visual appearance of
real-world surfaces and the dependence of appearance on
the geometry of imaging conditions. We discuss a new
texture representation called the BTF (bidirectional
texture function) which captures the variation in
texture with illumination and viewing direction. We
present a BTF database with image textures from over 60
different samples, each observed with over 200
different combinations of viewing and illumination
directions. We describe the methods involved in
collecting the database as well as the importance and
uniqueness of this database for computer graphics. A
related quantity to the BTF is the familiar BRDF
(bidirectional reflectance distribution function). The
measurement methods involved in the BTF database are
conducive to simultaneous measurement of the BRDF.
Accordingly, we also present a BRDF database with
reflectance measurements for over 60 different samples,
each observed with over 200 different combinations of
viewing and illumination directions. Both of these
unique databases are publicly available and have
important implications for computer graphics.",
acknowledgement = ack-nhfb,
keywords = "experimentation; measurement",
subject = "{\bf I.2.10} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Vision and Scene Understanding,
Intensity, color, photometry, and thresholding. {\bf
I.2.10} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Vision and Scene Understanding, Texture.
{\bf I.3.5} Computing Methodologies, COMPUTER GRAPHICS,
Computational Geometry and Object Modeling, Physically
based modeling. {\bf I.4.1} Computing Methodologies,
IMAGE PROCESSING AND COMPUTER VISION, Digitization and
Image Capture, Imaging geometry. {\bf I.4.1} Computing
Methodologies, IMAGE PROCESSING AND COMPUTER VISION,
Digitization and Image Capture, Radiometry. {\bf I.4.7}
Computing Methodologies, IMAGE PROCESSING AND COMPUTER
VISION, Feature Measurement, Texture. {\bf I.4.8}
Computing Methodologies, IMAGE PROCESSING AND COMPUTER
VISION, Scene Analysis, Photometry.",
}
@Article{Joan-Arinyo:1999:CCE,
author = "R. Joan-Arinyo and A. Soto-Riera",
title = "Combining constructive and equational geometric
constraint-solving techniques",
journal = j-TOG,
volume = "18",
number = "1",
pages = "35--55",
month = jan,
year = "1999",
bibdate = "Fri Jun 4 06:15:34 MDT 1999",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/journals/tog/1999-18-1/p35-joan-arinyo/",
abstract = "In the past few years, there has been a strong trend
towards developing parametric, computer-aided design
systems based on geometric constraint solving. An
effective way to capture the design intent in these
systems is to define relationships between geometric
and technological variables. In general, geometric
constraint solving including functional relationships
requires a general approach and appropriate techniques
to achieve the expected functional capabilities. This
work reports on a hybrid method that combines two
geometric constraint solving techniques: constructive
and equational. The hybrid solver has the capability of
managing functional relationships between dimension
variables and variables representing conditions
external to the geometric problem. The hybrid solver is
described as a rewriting system and is shown to be
correct.",
acknowledgement = ack-nhfb,
keywords = "design",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Geometrical problems a