summaryrefslogtreecommitdiff
path: root/info/biblio/font.bib
diff options
context:
space:
mode:
Diffstat (limited to 'info/biblio/font.bib')
-rw-r--r--info/biblio/font.bib103
1 files changed, 95 insertions, 8 deletions
diff --git a/info/biblio/font.bib b/info/biblio/font.bib
index c327012052..828b4c324d 100644
--- a/info/biblio/font.bib
+++ b/info/biblio/font.bib
@@ -2,9 +2,9 @@
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
-%%% version = "1.113",
-%%% date = "20 March 2021",
-%%% time = "16:51:08 MDT",
+%%% version = "1.115",
+%%% date = "22 June 2021",
+%%% time = "09:07:26 MDT",
%%% filename = "font.bib",
%%% address = "University of Utah
%%% Department of Mathematics, 110 LCB
@@ -14,7 +14,7 @@
%%% telephone = "+1 801 581 5254",
%%% FAX = "+1 801 581 4148",
%%% URL = "http://www.math.utah.edu/~beebe",
-%%% checksum = "50725 23627 108434 1030369",
+%%% checksum = "14612 23714 108898 1034928",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
@@ -24,7 +24,7 @@
%%% docstring = "This bibliography records publications about
%%% typographic fonts.
%%%
-%%% At version 1.113, the year coverage looked
+%%% At version 1.114, the year coverage looked
%%% like this:
%%%
%%% 1785 ( 1) 1864 ( 0) 1943 ( 0)
@@ -60,7 +60,7 @@
%%% 1833 ( 0) 1912 ( 0) 1991 ( 63)
%%% 1834 ( 0) 1913 ( 0) 1992 ( 80)
%%% 1835 ( 0) 1914 ( 1) 1993 ( 104)
-%%% 1836 ( 0) 1915 ( 0) 1994 ( 79)
+%%% 1836 ( 0) 1915 ( 0) 1994 ( 80)
%%% 1837 ( 0) 1916 ( 0) 1995 ( 46)
%%% 1838 ( 0) 1917 ( 0) 1996 ( 18)
%%% 1839 ( 0) 1918 ( 1) 1997 ( 5)
@@ -84,10 +84,11 @@
%%% 1859 ( 0) 1938 ( 0) 2017 ( 1)
%%% 1860 ( 0) 1939 ( 0) 2018 ( 2)
%%% 1861 ( 0) 1940 ( 1) 2019 ( 4)
+%%% 1863 ( 0) 1942 ( 0) 2021 ( 1)
%%% 19xx ( 3)
%%% 20xx ( 1)
%%%
-%%% Article: 501
+%%% Article: 503
%%% Book: 161
%%% Booklet: 4
%%% InCollection: 3
@@ -101,7 +102,7 @@
%%% TechReport: 25
%%% Unpublished: 1
%%%
-%%% Total entries: 940
+%%% Total entries: 942
%%%
%%% This bibliography has been collected from
%%% bibliographies in the author's personal
@@ -13662,6 +13663,68 @@
acknowledgement = ack-nhfb,
}
+@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 (print), 1557-7368 (electronic)",
+ ISSN-L = "0730-0301",
+ bibdate = "Sat Jan 13 12:40:37 1996",
+ bibsource = "http://www.math.utah.edu/pub/tex/bib/font.bib;
+ http://www.math.utah.edu/pub/tex/bib/tog.bib",
+ 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,
+ fjournal = "ACM Transactions on Graphics",
+ journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J778",
+ 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.",
+}
+
@Book{Knuth:1992:AH,
author = "Donald E. Knuth",
title = "Axioms and Hulls",
@@ -22829,6 +22892,30 @@
journal-URL = "http://www.tug.org/TUGboat/",
}
+@Article{Garfinkel:2021:NCM,
+ author = "Simson Garfinkel and Eugene H. Spafford",
+ title = "News: {Charles M. Geschke} (1939--2021)",
+ journal = j-CACM,
+ volume = "64",
+ number = "7",
+ pages = "22--22",
+ month = jul,
+ year = "2021",
+ CODEN = "CACMA2",
+ DOI = "https://doi.org/10.1145/3467481",
+ ISSN = "0001-0782 (print), 1557-7317 (electronic)",
+ ISSN-L = "0001-0782",
+ bibdate = "Tue Jun 22 08:44:27 MDT 2021",
+ bibsource = "http://www.math.utah.edu/pub/tex/bib/cacm2020.bib;;
+ http://www.math.utah.edu/pub/tex/bib/font.bib;
+ http://www.math.utah.edu/pub/tex/bib/typeset.bib",
+ URL = "https://dl.acm.org/doi/10.1145/3467481",
+ acknowledgement = ack-nhfb,
+ fjournal = "Communications of the ACM",
+ journal-URL = "https://dl.acm.org/loi/cacm",
+ keywords = "Adobe Systems co-founder",
+}
+
%%% ====================================================================
%%% Cross-referenced entries must come last: