% Last edited on 2003-03-03 19:08:48 by stolfi
@inproceedings{alm-car-fan-sto-03-syn-propor
author = {Sheila M. Almeida and Ariadne M. B. R. Carvalho and Lucien Fantin and Jorge Stolfi},
title = {A New Syntactic Parser for Portuguese},
booktitle = {Proceedings of 6th Workshop on Computational Processing of the Portuguese Language - Written and Spoken (PROPOR 2003)},
note = {Submitted},
pages = {--},
year = 2003
}
@article{fal-sto-lot-03-ift-tpami
author = {Alexandre X. Falcão and Roberto de A. Lotufo and Jorge Stolfi},
title = {The Image Foresting Transform: {Theory}, Algorithms, and Applications},
journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
year = 2003,
note = {Accepted for publication}
}
@inproceedings{and-bar-sto-02-smploc
author = {Marcus Vin{\'\i}cius A. Andrade and Wagner F. Barros and Jorge Stolfi},
title = {An exact algorithm for point location on spherical maps},
booktitle = {Anais do GEOINFO 2002 - IV Simp{\'o}sio Brasileiro de Geoinform{\'a}tica},
pages = {99--107},
month = dec,
year = 2002
}
@inproceedings{fig-sto-vel-02-parcur
author = {Luiz Henrique de Figueiredo and Jorge Stolfi and Luiz Velho},
title = {Approximating Parametric Curves with Strip Trees using Affine Arithmetic},
booktitle = {XV Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'02)},
month = oct,
year = 2002,
pages = {163--170},
url = {citeseer.nj.nec.com/article/defigueiredo02approximating.html}
}
% xav-sto-men-her-far-01-skew
@article{xav-sto-men-her-far-02-skew
author = {Celina M. H. de Figueiredo and {\'E}rico F. {Xavier} and
C{\^a}ndido F. Xavier de {Mendon{\c{a}} Neto} and Karl Schaffer and Jorge Stolfi and Lu{\'e}rbio {Faria}},
title = {The Splitting Number and Skewness of $C_n \times C_m$},
journal = {Ars Combinatoria},
volume = {63},
number = 1,
pages = {193--205},
year = 2002,
issn = {0381-7032}
}
@inproceedings{gom-sto-01-emap-pr
title = {Approximation Error Maps},
author = {Anamaria Gomide and Jorge Stolfi},
booktitle = {Proceedings of A4A4 - IV International Symposium on Algorithms for Approximation},
pages = {446--453},
year = 2001,
note = {Published in 2002}
isbn = {186218-040-7}
}
@article{lei-sto-01-frag-ptr
title = {Digitization and Reconstruction of Archaeological Artifacts},
author = {Helena C. G. {Leit{\~a}o} and Jorge Stolfi},
journal = {Proceedings of SIBGRAPI 2001 - 14th Brazilian Symposium on Computer Graphics and Image Processing},
month = oct,
year = 2001,
note = {Technical poster},
pages = {382},
isbn = {0-7695-1330-1}
}
% was lei-sto-01-frag-j
@article{lei-sto-02-frag-j
title = {A Multiscale Method for the Reassembly of Two-Dimensional Fragmented Objects},
author = {Helena C. G. {Leit{\~a}o} and Jorge Stolfi},
journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
volume = 24,
number = 9,
pages = {1239--1251},
month = sep,
year = 2002
}
@inproceedings{gom-sto-01-emap-abs
title = {Approximation Error Maps},
author = {Anamaria Gomide and Jorge Stolfi},
booktitle = {Abstracts of A4A4 - IV International Symposium on Algorithms for Approximation},
note = {Abstract},
pages = {2},
month = jul,
year = {2001}
}
@article{and-sto-01-circ
author = {Marcus Vin{\'\i}cius A. Andrade and Jorge Stolfi},
title = {Exact Algorithms for Circles on the Sphere},
journal = {International J. of Computational Geometry {\&} Applications},
volume = 11,
number = 3,
year = 2001,
month = jun,
pages = {267--290},
issn = {0218-1959}
}
@techreport{lei-sto-01-reltec
title = {A Multiscale Technique for Computer Assisted Re-Assembly of Fragmented Objects},
author = {Helena C. G. {Leit{\~a}o} and Jorge Stolfi},
month = mar,
year = 2001,
institution = {Institute of Computing, Univ. of Campinas},
number = {IC-01-04},
pages = {23},
abstract = {
We describe here an efficient algorithm for reassembling one or more
unknown objects that have been broken or torn into a large number $N$
of irregular fragments. The algorithm works by comparing the
curvature-encoded fragment outlines, using a modified dynamic
programming sequence-matching algorithm. By comparing the outlines at
progressively increasing scales of resolution, we manage to reduce the
cost of the search from $\theta(N^2 L^2)$ (where $L$ is the mean number of
samples per fragment) to about $O(N^2 L)$; which, in
principle, allows the method to be used for problems of practical size
($N = 10^3$ to $10^5$ fragments, $L = 10^3$ to $10^4$ samples). The
performance of the algorithm is illustrated with an artificial but
realistic example.
}
}
@techreport{gom-sto-01-emap-tr
title = {Approximation Error Maps},
author = {Anamaria Gomide and Jorge Stolfi},
institution = {Institute of Computing, Univ. of Campinas},
pages = {23},
number = {IC-01-01},
month = feb,
year = {2001},
abstract = {
Let $F$ and $A$ be two linear function spaces defined on some
domain $\Omega$. Let $\left\|\cdot\right\|$ be a vector
semi-norm for the space $A+F$. We consider here the question of
how well $A$ approximates $F$ in the sense of the metric
$\left\|\cdot\right\|$. Global error measures are insufficiently
informative when the space $A$ is not spatially homogeneous. We
introduce here the concept of {\em approximation error map}, a
mathematical description of how the approximation errors are
distributed over the domain --- not for a single function $f\in
F$, but for all such functions at once. We illustrate this
concept by computing the error maps of several harmonic spline
spaces on the circle and on the sphere.
}
}
@techreport{gom-sto-00-appr-tr
author = {Anamaria Gomide and Jorge Stolfi},
title = {Non-Homogeneous Spline Bases for Approximation on the Sphere},
number = {IC-00-19},
institution = {Institute of Computing, Univ. of Campinas},
month = dec,
year = {2000},
pages = {8},
abstract = {
A {\em spherical polynomial} is the restriction to the sphere
${\bf S}^2$ of a polynomial in the three coordinates $x,y,z$ of
${\bf R}^3$. Let $T$ be an arbitrary triangulation on the
sphere, and let ${\cal P}^d_k[T]/{\bf S}^2$ (resp ${\cal
H}^d_k[T]/{\bf S}^2$) be the space of all $C_k$-continuous
functions $f$ from ${\bf S}^2$ to ${\bf R}$ such that the
restriction of $f$ to each triangle of $T$ is a spherical
polynomial (resp. homogeneous). These are the {\em spherical
polynomial} (resp {\em homogeneous}) {\em splines} of degree
${}\leq d$ (resp. exactly $d$) and continuity $k$.
\par
In a previous paper, we have shown that ${\bf P}^d_k[T]/{\bf
S}^2 = {\cal H}^{d}_k[T]/{\bf S}^2 \oplus {\cal
H}^{d-1}_k[T]/{\bf S}^2$. Alfeld, Neamtu and Schumaker have
recently constructed explicit bases for the spaces ${\cal
H}^{d}_k[T]/{\bf S}^2$. Combining these two results, we obtain
explicit constructions for bases of ${\bf P}^d_k[T]/{\bf S}^2$.
\par
We believe that the general spline spaces ${\bf P}^d_k[T]/{\bf
S}^2$ provide better approximations than the homogeneous spaces
${\cal H}^d_k[T]/{\bf S}^2$ when used over the relatively large
regions (radius $10^{-1}$ to $10^{-2}$) that are likely to occur
in pratice. In this paper we report numerical experiments in
least squares approximation which offer some evidence for this
claim.
}
}
@inproceedings{loz-men-sto-00-vis3d
author = {Luis A. P. Lozada and C{\^a}ndido F. X. {de Mendon{\c{c}}a} and Jorge Stolfi},
title = {Visualization of Three-Dimensional Maps},
booktitle = {Proceedings of SIBGRAPI 2000 - 13th Brazilian Symposium on Computer Graphics and Image Processing},
month = oct,
year = 2000,
pages = {251--258},
isbn = {0-7695-0878-2}
}
@inproceedings{lei-sto-00-main
author = {Helena C. G. {Leit{\~a}o} and Jorge Stolfi},
title = {A Multi-Scale Method for the Re-Assembly of Fragmented Objects},
booktitle = {Proc. British Machine Vision Conference - BMVC 2000},
month = sep,
volume = 2,
pages={705--714},
year = 2000,
isbn = {1-901725-13-8}
}
@inproceedings{gom-sto-00-apspl
author = {Anamaria Gomide and Jorge Stolfi},
title = {Ordem de Aproxima{\c{c}}{\~a}o de Splines Polinomiais Esf{\'e}ricos n{\~a}o Homog{\^e}neos},
month = sep,
year = 2000,
booktitle = {Anais do XXIII Congresso Nacional de Matem{\'a}tica
Aplicada e Computacional},
volume = {1},
pages = {246--246},
year = 2000
}
@misc{gom-sto-00-appr-f
author = {Anamaria Gomide and Jorge Stolfi},
title = {Non-Homogeneous Spline Bases for Approximation on the Sphere},
howpublished = {Unpublished manuscript},
note = {Final version of~[gom-sto-99-appr], submitted for the
Proc. the 4th International Conference on Curves and Surfaces,
not accepted.},
month = jul,
year = 2000
}
@techreport{gom-sto-00-polsp-tr
number = {IC-00-10},
title = {Non-Homogeneous Polynomial {$C_k$} Splines on the Sphere {$S^n$}},
author = {Anamaria Gomide and Jorge Stolfi},
month = jul,
year = 2000,
institution = {Institute of Computing, Univ. of Campinas},
pages = {13},
abstract = {
A {\em homogeneous spherical polynomial} (HSP) is the restriction to the
sphere $S^{n-1}$ of a homogeneous polynomial on the cartesian
coordinates $x_1, x_2,\dots,x_n$ of $R^n$. A {\em homogeneous spherical
spline} is a function that is an HSP within each element of a geodesic
triangulation of $S^{n-1}$.
\par
There has been considerable interest recently in the use of such
splines for approximation of functions defined on the sphere. In
this paper we introduce the {\em general} (non-homogeneous) {\em
spherical splines} and argue that they are a more natural
approximating spaces for spherical functions than the
homogeneous ones. It turns out that the space of general
spherical polynomials of degree $d$ is the direct sum of the
homogeneous spherical polynomials of degrees $d$ and $d-1$. We
then generalize this decomposition result to polynomial splines
defined on a geodesic triangulation (spherical simplicial
decomposition) $T$ of the sphere $S^{n-1}$, of arbitrary degree
$d$ and continuity order $k$.
\par
For the particular case $n=3$, the homogeneous spline spaces
were extensively studied by Alfeld, Neamtu, and Schumaker, who
showed how to construct explicit local bases when $d\geq 3k +
2$. Combining their construction with our decomposition theorem,
we obtain an explicit construction for a local basis of the
general polynomial splines when $d\geq 3k + 3$.
}
}
@inproceedings{lei-sto-00-bits
author = {Helena C. G. {Leit{\~a}o} and Jorge Stolfi},
title = {Information Contents of Fracture Lines},
booktitle = {Proc. WSCG'2000 - the 8th International Conference in Central Europe on Computer Graphics, Visualization, and Interactive Digital Media},
publisher = {Univ. of West Bohemia Press},
volume = {2},
month = feb,
pages={389--395},
year = 2000,
isbn = {80-7082-612-6}
}
@book{sto-toz-99-sib
editor = {Jorge Stolfi and Cl{\'e}sio L. Tozzi},
title = {Proceedings of SIBGRAPI'99 - XII Brazilian Symposium on Computer Graphics and Image Processing},
month = oct,
publisher = {IEEE Computer Society Press},
year = 1999,
pages={357},
isbn = {0-7695-0481-7}
}
@inproceedings{eri-gui-sto-zha-99
author = {Jeff Erickson and Leonidas J. Guibas and Jorge Stolfi and Li Zhang},
title = {Separation-Sensitive Collision Detection for Convex Objects},
booktitle = {Proceedings of the 10th ACM/SIAM Symposium on Discrete Algorithms (SODA 1999)},
month = jan,
pages = {327--336},
year = 1999
}
@misc{men-sch-xav-sto-99-splt
author = {C{\^a}ndido Xavier de Mendon{\c{c}}a Neto and Karl Schaffer and {\'E}rico F. Xavier and Lu{\'e}rbio Faria and Celina M. H. de Figueiredo and Jorge Stolfi},
title = {The Splitting Number of {$C_n\times C_m$}},
howpublished = {Unpublished manuscript},
note = {Submitted Journal of Theoretical Computer Science, rejected.},
month = {??},
year = 1999
}
@techreport{loz-men-sto-99-vis3d-tr
number = {IC-99-28},
title = {Automatic Visualization of {3D} Complexes},
author = {Luis A. P. Lozada and Candido F. X. {de Mendon{\c{c}}a} and Jorge Stolfi},
month = dec,
year = 1999,
institution = {Institute of Computing, Univ. of Campinas},
pages = {13},
abstract = {
A three-dimensional complex is a partition of a three-dimensional
manifold into simple cells, faces, edges and vertices. We consider
here the problem of automatically producing a ``nice'' geometric
representation (in $\Re^{m}$, for $m\geq 3$) of an arbitrary 3D
complex, given only its combinatorial description. The geometric
realization is chosen by optimizing certain aesthetic criteria,
measured by certain ``energy functions.''
}
}
@techreport{lei-sto-99-bits-tr
number = {IC-99-24},
title = {Information Contents of Fracture Lines},
author = {Helena C. G. {Leit{\~a}o} and Jorge Stolfi},
month = dec,
year = 1999,
institution = {Institute of Computing, Univ. of Campinas},
pages = {15},
abstract = {
Reassembling unknown broken objects from a large collection
of fragments is a common problem in archaeology and other fields.
Computer tools have recently been developed, by the authors and by
others, which try to help by identifying pairs of fragments with matching
outline shapes. These tools have been succesfully tested on small
collections of fragments; here we address the question of whether
they can be expected to work also for practical instances of the problem
($10^3$ to $10^5$ fragments). To that end, we describe here a method
to measure the average amount of information contained in the shape of
a fracture line of given length. This parameter tells us how many
false matches we can expect to find for that fracture among a given
set of fragments. In particular, the numbers we obtained for
ceramic fragments indicate that fragment outline comparison should
give useful results even for large instances.
}
}
@inproceedings{gom-sto-99-appr
author = {Anamaria Gomide and Jorge Stolfi},
title = {Non-Homogeneous Spline Bases for Approximation on the Sphere},
booktitle = {Abstracts of the 4th International Conference on Curves and Surfaces},
address = {Saint-Malo, France},
pages = {27},
month = jul,
year = 1999
}
@techreport{men-xav-sto-far-fig-99-vdst-tr
author = {C{\^a}ndido F. Xavier de {Mendon{\c{c}}a Neto} and {\'E}rico F. Xavier and Lu{\'e}rbio Faria and Celina M. H. de Figueiredo and Jorge Stolfi},
title = {The Vertex Deletion Number and Splitting Number of a Triangulation of {$C_n \times C_m$}},
month = jun,
year = 1999,
institution = {Institute of Computing, Univ. of Campinas},
pages = {8},
abstract = {
The vertex deletion number $\phi(G)$ of a graph $G$ is the
minimum number of vertices that must be deleted from $G$ to
produce a planar graph. The splitting number $\sigma(G)$ of $G$
is the smallest number of vertex splitting operations that must
be applied to $G$ to make it planar. Here we determine these
topological invariants for the graph family ${\cal T}_{C_n
\times C_m}$, a regular triangulation of the torus obtained by
adding parallel diagonal edges to the faces of the rectangular
toroidal grid $C_n \times C_m$. Specifically, we prove that the
obvious upper bound $\phi = \sigma = \min\{n,m\}$ is also a
lower bound.
}
}
@article{men-dan-sto-99-grdr
author = {Jorge Stolfi and Hugo A. D. Nascimento and C{\^a}ndido Ferreira Xavier de Mendon{\c{c}}a},
title = {Heuristics and Pedigrees for Drawing Directed Graphs},
journal = {Journal of the Brazilian Computer Society},
pages = {38--49},
volume = {6},
number = {1},
month = jul,
year = 1999
}
@misc{sto-99-voytk
author = {Jorge Stolfi},
title = {The Voynich Manuscript},
howpublished = {Talk presented at the Special Session on Combinatorics
of the 22nd Brazilian Matematics Colloquium, IMPA, Rio de Janeiro.
Transparencies avaliable at \url{//www.dcc.unicamp.br/~stolfi/},
file \url{EXPORT/papers/by-tag/sto-99-voytk.ps.gz}},
year = 1999,
month = jul
}
*
@techreport{men-xav-far-fig-sto-99-vdel-tr
number = {IC-99-14},
title = {The Vertex Deletion Number of {$C_n \times C_m$}},
author = {C{\^a}ndido F. Xavier de {Mendon{\c{c}}a Neto} and {\'E}rico F. {Xavier} and Lu{\'e}rbio Faria and Celina M. H. de Figueiredo and Jorge Stolfi},
month = may,
year = 1999,
institution = {Institute of Computing, Univ. of Campinas},
pages = {39},
abstract = {
The vertex deletion number of a graph $G$ is the smallest
integer $k \geq 0$ such that there is a planar induced subgraph
of $G$ obtained by the removal of $k$ vertices from $G$.
In this work we study the vertex deletion number of
$C_n\times C_m$, the rectangular grid with toroidal topology.
We prove the extact result $\min\{n,m\} - \xi_{5,9}(n,m)$,
where $\xi_{i,j}(k_1,k_2)$ is the number of true conditions
among the following: (i) $k_1 = k_2 \leq i$ and
(ii) $k_1 + k_2 \leq j$.
}
}
@article{che-gol-mar-set-sto-98-mflo
author = {Boris V. Cherkassky and Andrew V. Goldberg and Paul Martin and Jo{\~a}o C. Setubal and Jorge Stolfi},
title = {Augment or Push? {A} Computational Study of Bipartite Matching and Unit Capacity Maximum Flow Algorithms},
journal = {ACM Journal of Experimental Algorithmics},
pages = {},
volume = {3},
number = {8},
month = jan,
year = 1999
}
@misc{sto-98-eplt
author = {Jorge Stolfi},
title = {Where are the Bits? {Local} Entropy Distribution of Various Languages},
howpublished = {WWW document at \url{//www.dcc.unicamp.br/},
file \url{~stolfi/voynich/98-07-09-local-entropy/}},
year = 1998,
month = jul
}
@misc{sto-98-pgplots
author = {Jorge Stolfi},
title = {Scatterplots of {VMs} Pages},
howpublished = {WWW document at \url{//www.dcc.unicamp.br/},
file \url{~stolfi/voynich/98-06-19-page-plots/}},
year = 1998,
month = jul
}
@inproceedings{and-sto-98-circ
author = {Marcus Vin{\'\i}cius A. Andrade and Jorge Stolfi},
title = {Exact Algorithms for Circles on the Sphere},
booktitle = {Proc. the 14th ACM Symposium on Computational Geometry},
address = {Minneapolis, MN},
pages = {126--134},
month = jun,
year = 1998,
abstract = {
We develop exact algorithms for geometric operations on
general circles and circular arcs on the sphere, using integer
homogeneous coordinates. The algorithms include testing a point
against a circle, computing the intersection of two circles, and
ordering three arcs out of the same point. These operations allow
robust manipulation of maps on the sphere, providing a reliable
framework for GIS, robotics, and other geometric applications.
}
}
@techreport{and-sto-98-circtr
number = {IC-98-08},
title = {Exact Algorithms for Circles on the Sphere},
author = {{Marcus Vin{\'\i}cius} A. Andrade and Jorge Stolfi},
month = apr, year = 1998,
institution = {Institute of Computing, Univ. of Campinas},
pages = {16},
language = engl,
abstract = {
We develop exact algorithms for geometric operations on
general circles and circular arcs on the sphere, using integer
homogeneous coordinates. The algorithms include testing a point
against a circle, computing the intersection of two circles, and
ordering three arcs out of the same point. These operations allow
robust manipulation of maps on the sphere, providing a reliable
framework for GIS, robotics, and other geometric applications.
\par
(Superseded by~[and-sto-98-circ].)
}
}
%SH-0-98
@techreport{lei-sto-98-frag-tr
author = {Helena C. G. {Leit{\~a}o} and Jorge Stolfi},
title = {Automatic Reassembly of Irregular Fragments},
number = {IC-98-06},
month = apr,
year = 1998,
institution = {Institute of Computing, Univ. of Campinas},
pages = {38},
abstract = {
This report addresses the following problem: given one or more
unknown objects that have been broken or torn into a large
number of irregular fragments, find the pairs of fragments
that were adjacent in the original objects.
\par
Our approach is based on information extracted from the fragment
outlines, which is used to compute the mismatch between pairs of
pieces of contour. In order to asymptotically reduce the cost of
matching, we use a {\em multiple scales} technique: after
filtering and resampling the fragment outlines at several
different scales of detail, we look for initial matchings at the
coarsest possible scale. We then repeatedly select the most
promising pairs, and re-match them at the next finer scale of
detail. In the end, we are left with a small set of fragment
pairs that are most likely to be adjacent in the original
object.
}
}
%SH-1-98
@techreport{lei-sto-98-cmpf-tr
author = {Helena C. G. {Leit{\~a}o} and Jorge Stolfi},
title = {Comparing Fracture Lines},
type = {in preparation},
number = {IC-TR-??-??},
institution = {Institute of Computing, Univ. of Campinas},
month = {???},
year = {????}
}
%SH-2-98
@techreport{lei-sto-98-filt-tr
author = {Helena C. G. {Leit{\~a}o} and Jorge Stolfi},
title = {Geometric Curve Filtering},
type = {in preparation},
number = {IC-TR-??-??},
institution = {Institute of Computing, Univ. of Campinas},
month = {???},
year = {????}
}
@inproceedings{gom-sto-98-basp
author = {Anamaria Gomide and Jorge Stolfi},
title = {Bases for Non-Homogeneous Polynomial {${\bf C}_{k}$} Splines on the Sphere},
booktitle = {Lecture Notes in Computer Science 1380: Proc. LATIN'98 - Latin American Theoretical Informatics Conference},
publisher = {Springer},
pages = {133--140},
month = apr,
year = 1998
}
@misc{sto-97-okokoko
author = {Jorge Stolfi},
title = {{OKOKOKO}: {The} Fine Structure of {Voynichese} Words},
howpublished = {WWW document at \url{//www.dcc.unicamp.br/~stolfi/},
file \url{voynich/Notes/017/Note-017.html}},
year = 1998,
month = mar
}
@techreport{kow-luc-sto-98-lexitr
author = {Tomasz Kowaltowski and Cl{\'a}udio L. Lucchesi and Jorge Stolfi},
title = {Finite Automata and Efficient Lexicon Implementation},
number = {IC-98-02},
month = jan,
year = 1998,
institution = {Institute of Computing, Univ. of Campinas},
pages = {12},
abstract = {
We describe a general technique for the encoding of lexical
functions---such as lexical classification, gender and number marking,
inflections and conjugations---using minimized acyclic finite-state
automata. This technique has been used to store a Portuguese lexicon
with over 2 million entries in about 1 megabyte. Unlike general file
compression schemes, this representation allows random access to the
stored data. Moreover it allows the lexical functions and their
inverses to be computed at negligible cost. The technique can be
easily adapted to practically any language or lexical classification
scheme, and this task does not require any knowledge of the programs
or data structures.
}
}
@misc{sto-97-pms
author = {Jorge Stolfi},
title = {A Prefix-Midfix-Suffix Decomposition of {Voynichese} Words},
howpublished = {WWW document at \url{//www.dcc.unicamp.br/~stolfi/},
file \url{voynich/97-11-12-pms/}},
year = 1997,
month = dec
}
@inproceedings{and-sto-97-smap
title = {Exact Representation and Operations on Spherical Maps},
author = {Marcus Vin{\'\i}cius A. Andrade and Jorge Stolfi},
booktitle = {X Simp{\'o}sio Brasileiro de Computa{\c{c}}{\~a}o Gr{\'a}fica e Processamento de Imagens (SIBGRAPI'97)},
pages = {79--86},
address = {Campos do Jord{\~a}o, SP (Brazil)},
month = oct,
year = 1997
}
@inproceedings{che-gol-mar-set-sto-97-mflo
author = {Boris V. Cherkassky and Andrew V. Goldberg and Paul Martin and Jo{\~a}o C. Setubal and Jorge Stolfi},
title = {Augment or Push? {A} Computational Study of Bipartite Matching and Unit Capacity Maximum Flow Algorithms},
booktitle = {Proc. WAE '97 -- Workshop on Algorithm Engineering},
pages = {1--10},
address = {Venice, Italy},
month = sep,
year = 1997
}
@techreport{lie-sto-97-simv
author = {R. L. W. Liesenfeld and J. Stolfi},
title = {Realistic Simulation of Viscoelastic Bodies},
institution = {Institute of Computing, Univ. of Campinas},
number = {IC-97-12},
pages = {22},
month = sep,
year = 1997,
abstract = {
We describe an animation system that simulates the dynamics of
viscoelastic bodies subject to equality and inequality constraints.
We show how Lagrange's method can be used to derive the equations of
motion of such bodies from general formulas for the elastic and
kinetic energy, the viscous power loss, and mechanical constraints, in
terms of generalized coordinates.
\par
We also describe a convenient two-parameter non-linear model for the
elastic forces, that agrees with Hooke's law for small deformations,
but does not allow the material to be compressed to zero or negative
volume. In particular, we derive the equations of motion for elastic
bodies modeled by tetrahedral finite elements with affine deformations.
Finally, we show
how collisions between such bodies can be efficiently and accurately
detected by combining Hermite interpolation of the non-penetration
constraints with Lin and Manocha's bounding box tests.
}
}
@techreport{gom-sto-97-basptr
author = {Anamaria Gomide and Jorge Stolfi},
title = {Bases para Splines Polinomiais N{\~a}o Homog{\^e}neos {${\bf C}_k$} na Esfera},
institution = {Institute of Computing, Univ. of Campinas},
number = {IC-97-10},
pages = {9},
note = {(in Portuguese)},
month = sep,
year = 1997,
abstract = {
We investigate the use of non-homogeneous spherical polynomials
for the approximation of functions defined on the sphere
${\bf S}^2$. A {\em spherical polynomial} is the restriction to
${\bf S}^2$ of a polynomial in the three coordinates $x,y,z$ of
${\bf R}^3$. Let ${\cal P}^d$ be the space of spherical polynomials
with degree ${}\leq d$. We show that ${\cal P}^d$ is the direct sum of
${\cal H}^d$ and ${\cal H}^{d-1}$, where ${\cal H}^d$ denotes the space of {\em
homogeneous} degree-$d$ polynomials in $x,y,z$.
\par
We also generalize this result to splines defined on a geodesic
triangulation $T$ of the sphere. Let ${\cal P}^d_k[T]$ denote the
space of all functions $f$ from ${\bf S}^2$ to ${\bf R}$ such
that (1) the restriction of $f$ to each triangle of $T$ belongs
to ${\cal P}^d$; and (2) the function $f$ has order-$k$
continuity across the edges of $T$. Analogously, let ${\cal
H}^{d}_k[T]$ denote the subspace of ${\cal P}^d_k[T]$ consisting
of those functions that are ${\cal H}^d$ within each triangle of
$T$. We show that ${\cal P}^d_k[T] = {\cal H}^{d}_k[T]\oplus
{\cal H}^{d-1}_k[T]$. Combined with results of Alfeld, Neamtu
and Schumaker on bases of ${\cal H}^{d}_k[T]$ this decomposition
provides on effective characterization of the bases of ${\cal
P}^d_k[T]$.
\par
There has been considerable interest recently in the use of the
homogeneous spherical splines ${\cal H}^{d}_k[T]$ as approximations for
functions defined on ${\bf S}^2$. We argue that the non-homogeneous
splines ${\cal P}^d_k[T]$ would be a more natural choice for that purpose.
}
}
@book{fig-sto-97-iaaa
title = {Self-Validated Numerical Methods and Applications},
author = {Luiz H. {de Figueiredo} and Jorge Stolfi},
series = {Brazilian Mathematics Colloquium monographs},
publisher = {IMPA/CNPq, Rio de Janeiro, Brazil},
year = 1997
}
@techreport{fig-iwa-sto-97-got
title = {Fast Interval Branch-and-Bound Methods for Unconstrained Global Optimization with Affine Arithmetic},
author = {Luiz H. {de Figueiredo} and Ronald {Van Iwaarden} and Jorge Stolfi},
institution = {Institute of Computing, Univ. of Campinas},
number = {IC-97-08},
month = jun,
year = 1997,
abstract = {
We show that faster solutions to unconstrained global
optimization problems can be obtained by combining previous
accelerations techniques for interval branch-and-bound methods
with affine arithmetic, a recent alternative to interval
arithmetic that often provides tighter estimates. We support
this claim by solving a few well-known optimization problems.
}
}
@article{fig-sto-96-imp
title = {Adaptive Enumeration of Implicit Surfaces with Affine Arithmetic.},
author = {Luiz H. {de Figueiredo} and Jorge Stolfi},
journal = {Computer Graphics Forum},
year = 1996,
month = dec,
volume = {15},
number = {5},
pages = {287--296}
}
@inproceedings{and-sto-96-exmap
author = {Marcus Vin{\'\i}cius A. Andrade and Jorge Stolfi},
title = {Representa{\c{c}}{\~a}o Exata de C{\'\i}rculos na Esfera},
booktitle = {Anais do Workshop do Projeto Geotec-CNPq 1996},
pages = {20-25},
month = {},
year = 1996
}
@inproceedings{lie-sto-96-anim
title = {Dynamic Animation of Elastic Bodies},
author = {Rog{\'e}rio L. W. Liesenfeld and Jorge Stolfi},
booktitle = {Anais do IX Simp{\'o}sio Brasileiro de Computa{\c{c}}{\~a}o Gr{\'a}fica e Processamento de Imagens (SIBGRAPI'96)},
pages = {265--272},
address = {Caxamb{\'u}, MG (Brazil)},
month = oct,
year = 1996
}
@inproceedings{lei-sto-96-frag
title = {Reconstru{\c{c}}{\~a}o de Objetos Fragmentados},
author = {Helena C. G. {Leit{\~a}o} and Jorge Stolfi},
booktitle = {Anais do IX Simp{\'o}sio Brasileiro de Computa{\c{c}}{\~a}o Gr{\'a}fica e Processamento de Imagens (SIBGRAPI'96)},
pages = {365--366},
address = {Caxamb{\'u}, MG (Brazil)},
month = oct,
year = 1996
}
@misc{lei-sto-97-frag-e
title = {Reconstruction of Fragmented Objects},
author = {Helena C. G. {Leit{\~a}o} and Jorge Stolfi},
howpublished = {Unpublished manuscript.},
pages = {2},
note = {English translation of~[lei-sto-96-frag].},
month = jan,
year = 1997
}
@inproceedings{ros-men-loz-sto-96-vis
title = {Automatic Visualization of Two-Dimensional Cellular Complexes},
author = {Rober M. Rosi and C{\^a}ndido F. X. {de Mendon{\c{c}}a Neto} and Lu{\'\i}s A. P. Lozada and Jorge Stolfi},
booktitle = {Lecture Notes in Computer Science 1190: Proc. Graph Drawing '96},
editor = {Stephen North},
publisher = {Springer},
month = sep,
pages = {303--317},
address = {Berkeley, Calif.},
year = 1996
}
@article{cha-ede-gui-sha-sto-96-lines
title = {Lines in Space: {C}ombinatorics and Algorithms},
author = {Bernard Chazelle and Herbert Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Jorge Stolfi},
journal = {Algorithmica},
volume = {15},
number = {5},
pages = {428--447},
month = may,
year = 1996
}
@techreport{ros-sto-96-vistr
title = {Automatic Visualization of Two-Dimensional Cellular Complexes},
author = {Rober M. Rosi and Jorge Stolfi},
institution = {Institute of Computing, Univ. of Campinas},
number = {IC-96-02},
month = may,
year = 1996,
abstract = {
A two-dimensional cellular complex is a partition of a surface
into a finite number of elements---faces (open disks), edges
(open arcs), and vertices (points). The topology of a cellular
complex consists of the abstract incidence and adjacency
relations among its elements.
\par
Here we describe a program that, given only the topology of a
cellular complex, computes a geometric realization of the
same---that is, a specific partition of a specific surface in
three-space---guided by various aesthetic and presentational
criteria.
}
}
@techreport{luc-rez-sto-96-abs
title = {{DCC-IMECC-UNICAMP} {Technical} {Reports} 1992-1996: Abstracts},
author = {Cl{\'a}udio L. Lucchesi and Pedro J. de Rezende and Jorge Stolfi},
institution = {Instituto de Computa{\c{c}}{\~a}o, Univ. of Campinas},
number = {IC-96Abs},
month = may,
year = 1996
}
@article{sto-set-96-cro
title = {Uma Cronologia Computacional},
author = {Jorge Stolfi and Jo{\~a}o C. Setubal},
journal = {Boletim do IMECC},
volume = {1},
number = {1},
pages = {3--8},
note = {In Portuguese.},
month = apr,
year = 1996
}
@misc{sto-96-tsyn
title = {Texture Synthesis by Example},
author = {Jorge Stolfi},
howpublished = {Brazilian Workshop '96 on Mathematical Morphology},
month = feb,
year = 1966,
pages = {13 pp},
note = {Slides from a talk, available at \url{//www.inpe.br/~banon/}.}
}
@inproceedings{lie-sto-95-anim
title = {Anima{\c{c}}{\~a}o Din{\^a}mica de Corpos El{\'a}sticos},
author = {Rog{\'e}rio L. W. Liesenfeld and Jorge Stolfi},
booktitle = {VIII Simp{\'o}sio Brasileiro de Computa{\c{c}}{\~a}o Gr{\'a}fica e Processamento de Imagens (SIBGRAPI'95)},
pages = {319--320},
address = {S{\~a}o Carlos, SP (Brazil)},
month = oct,
year = 1995
}
@article{luc-kow-sto-95-min
author = {Cl{\'a}udio L. Lucchesi and Tomasz Kowaltowski and Jorge Stolfi},
title = {Minimization of Binary Finite Automata},
journal = {Journal of the Brazilian Computer Society},
volume = {1},
number = {3},
pages = {5--11},
month = apr,
year = 1995
}
@article{luc-kow-sto-95-app
author = {Cl{\'a}udio L. Lucchesi and Tomasz Kowaltowski and Jorge Stolfi},
title = {Applications of Finite Automata in Debugging Natural Language Vocabularies},
journal = {Journal of the Brazilian Computer Society},
volume = {1},
number = {3},
pages = {5--11},
month = apr,
year = 1995
}
@inproceedings{fig-sto-95-imp
title = {Adaptive Enumeration of Implicit Surfaces with Affine Arithmetic},
author = {Luiz H. {de Figueiredo} and Jorge Stolfi},
booktitle = {Proc. the Eurographics Workshop on Implicit Surfaces '95},
pages = {161--170},
address = {Grenoble (France)},
month = apr,
year = 1995
}
@techreport{fig-sto-95-impt
title = {Adaptive Enumeration of Implicit Surfaces with Affine Arithmetic},
author = {Luiz H. {de Figueiredo} and Jorge Stolfi},
institution = {Departamento de Ci\^{e}ncia da Computa{\c{c}}{\~a}o, Univ. of Campinas},
number = {DCC-95-02},
month = mar,
year = 1995,
pages = {16},
abstract = {
We discuss adaptive enumeration and rendering methods for implicit
surfaces, using octrees computed with affine arithmetic, a new
tool for range analysis. Affine arithmetic is similar to standard
interval arithmetic, but takes into account correlations between
operands and sub-formulas, generally providing much tighter bounds
for the computed quantities. The resulting octrees are accordingly
much smaller, and the rendering faster. We also describe
applications of affine arithmetic to intersection and ray tracing
of implicit surfaces.
}
}
@inproceedings{mac-sto-94-seg
title = {Segmenta{\c{c}}{\~a}o de Retas no Espa{\c{c}}o Tridimensional},
author = {Marcellus R. Mac\^{e}do and Jorge Stolfi},
booktitle = {Anais do XXI SEMISH -- Semin{\'a}rio Integrado de Hardware e Software},
pages = {69--83},
address = {Caxamb{\'u}, MG (Brazil)},
month = aug,
year = 1994
}
@article{sno-sto-94-hands
title = {Objects that Cannot be Taken Apart with Two Hands},
author = {Jack Snoeyink and Jorge Stolfi},
journal = {Discrete and Computational Geometry},
volume = {12},
pages = {367--384},
year = 1994
}
@inproceedings{ros-sto-94-vis
author = {Rober M. Rosi and Jorge Stolfi},
title = {Visualiza{\c{c}}{\~a}o Autom{\'a}tica de Complexos Celulares Arbitr{\'a}rios},
booktitle = {Anais do XXI SEMISH -- Semin{\'a}rio Integrado de Hardware e Software},
organization = {Sociedade Brasileira de Computa{\c{c}}{\~a}o},
pages = {85--98},
address = {Caxamb{\'u}, MG (Brazil)},
month = aug,
year = 1994
}
@book{rez-sto-94-fgc
author = {Pedro J. de Rezende and Jorge Stolfi},
title = {Fundamentos de Geometria Computacional},
pages = {208},
publisher = {IX Escola de Computa{\c{c}}{\~a}o},
address = {Recife (Brazil)},
month = {jul},
year = 1994
}
@inproceedings{and-com-sto-94-aa
title = {Affine Arithmetic},
author = {Marcus V. A. Andrade and Jo{\~a}o L. D. Comba and Jorge Stolfi},
booktitle = {Abstracts of the International Conference on Interval and Computer-Algebraic Methods in Science and Engineering (INTERVAL/94)},
pages = {36--40},
address = {St. Petersburg (Russia)},
month = mar,
year = 1994
}
@misc{and-com-sto-94-aax
title = {Affine Arithmetic},
author = {Marcus V. A. Andrade and Jo{\~a}o L. D. Comba and Jorge Stolfi},
howpublished = {Unpublished manuscript},
note = {Full version of~[and-com-sto-94-aa].},
pages = {10},
month = mar,
year = 1994
}
@inproceedings{com-sto-93-aa
title = {Affine Arithmetic and its Applications to Computer Graphics},
author = {Jo{\~a}o L. D. Comba and Jorge Stolfi},
booktitle = {Anais do VI Simp{\'o}sio Brasileiro de Computa{\c{c}}{\~a}o Gr{\'a}fica e Processamento de Imagens (SIBGRAPI'93)},
pages = {9--18},
address = {Recife (Brazil)},
month = oct,
year = 1993
}
@inproceedings{luc-kow-sto-93-bug
title = {Applications of Finite Automata in Debugging Natural Language Vocabularies},
author = {Cl{\'a}udio L. Lucchesi and Tomasz Kowaltowski and Jorge Stolfi},
booktitle = {Proc. the First South American Workshop on String Processing},
pages = {93--103},
address = {Universidade Federal de Minas Gerais, Belo Horizonte (Brazil)},
month = sep,
year = 1993
}
@inproceedings{luc-kow-sto-93-min
title = {Minimization of Binary Finite Automata},
author = {Cl{\'a}udio L. Lucchesi and Tomasz Kowaltowski and Jorge Stolfi},
booktitle = {Proc. the First South American Workshop on String Processing},
pages = {105--116},
address = {Universidade Federal de Minas Gerais, Belo Horizonte (Brazil)},
month = sep,
year = 1993
}
@techreport{luc-kow-sto-93-mintr
title = {Minimization of Binary Finite Automata},
author = {Cl{\'a}udio L. Lucchesi and Tomasz Kowaltowski and Jorge Stolfi},
number = {DCC-93-22},
institution = {Departamento de Ci\^{e}ncia da Computa{\c{c}}{\~a}o, Univ. of Campinas},
pages = {20},
month = sep,
year = 1993,
abstract = {
Finite automata used to represent large vocabularies of natural
languages are quite sparse in the following sense: for the vast
majority of states, almost all transitions lead to the rejecting
state. This suggests a representation of the automaton in which
each state is a small list of transitions entering non rejecting
states. It is then possible to factor parts of those lists,
thereby saving further space. Depending on the order in which the
transitions appear on the lists, the degree of saving varies. This
leads to the problem of minimizing such representations. This
problem is interesting from a theoretical point of view and quite
useful from a practical point of view, as the experimental results
presented herein indicate.
}
}
@techreport{luc-kow-sto-93-bugtr
title = {Applications of Finite Automata in Debugging Natural Language Vocabularies},
author = {Cl{\'a}udio L. Lucchesi and Tomasz Kowaltowski and Jorge Stolfi},
number = {DCC-93-21},
institution = {Departamento de Ci\^{e}ncia da Computa{\c{c}}{\~a}o, Univ. of Campinas},
pages = {16},
month = sep,
year = 1993,
abstract = {
Finite acyclic automata can be used as a very versatile tool in
many applications involving natural language vocabularies. This
work describes some experiments in ``debugging''
semi-automatically such vocabularies, i.e.~suggesting
non-existent and missing words. Partial statistics are shown for
Portuguese, Italian and English vocabularies.
}
}
@article{gui-sal-sto-93-eps
author = {David Salesin and Leonidas J. Guibas and Jorge Stolfi},
title = {Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives},
journal = {Algorithmica},
volume = {9},
number = {6},
pages = {534--560},
month = jun,
year = 1993
}
@inproceedings{sno-sto-93-hands
title = {Objects that Cannot be Taken Apart with Two Hands},
author = {Jack Snoeyink and Jorge Stolfi},
booktitle = {Proc. the 9th Annual Symposium on Com\-put\-atio\-nal Geometry (SOCG)},
address = {San Diego, Calif.},
organization = {ACM},
pages = {247--256},
month = may,
year = 1993
}
@techreport{sno-sto-93-hands-tr
author = {Jack Snoeyink and Jorge Stolfi},
title = {Objects That Cannot Be Taken Apart With Two Hands},
number = {TR-93-31},
institution = {CS Department, Univ. of British Columbia},
pages = {17},
month = oct,
year = 1993,
url = {ftp://ftp.cs.ubc.ca/ftp/local/techreports/1993/TR-93-31.ps},
abstract = {
It has been conjectured that every configuration {\it C} of convex
objects in 3-space with disjoint interiors can be taken apart by
translation with two hands: that is, some proper subset of {\it C}
can be translated to infinity without disturbing its complement.
We show that the conjecture holds for five or fewer objects and
give a counterexample with six objects. We extend the
counterexample to a configuration that cannot be taken apart with
two hands using arbitrary isometries (rigid motions). .br Note:
some figures have been omitted from the online version to save
space.
}
}
@inproceedings{sto-91-compgeo
title = {Graphics, Geometry, and Computing},
author = {Jorge Stolfi},
note = {Invited talk},
booktitle = {Proc. COMPUGRAPHICS '91},
address = {Sesimbra (Portugal)},
pages = {1.1--1.18},
month = sep,
year = 1991
}
@book{sto-91-opg
author = {Jorge Stolfi},
title = {Oriented Projective Geometry},
pages = {237},
publisher = {Academic Press},
address = {Boston},
year = 1991,
isbn = {0-12-672025-8}
}
@inproceedings{sal-sto-90-zzcsg
title = {Rendering {CSG} Models with a {ZZ}-Buffer},
author = {David Salesin and Jorge Stolfi},
booktitle = {Proc. SIGGRAPH '90},
pages = {67--76},
publisher = {ACM Press/Addison-Wesley},
month = aug,
year = 1990
}
@techreport{cha-ede-gui-sha-sto-90-lintr
author = {Bernard Chazelle and Herbert Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Jorge Stolfi},
title = {Lines in Space: {Combinatorics} and Algorithms},
institution = {Department of Computer Science, University of Illinois at Urbana-Champaign},
address = {Urbana, Illinois},
year = 1990,
number = {1569},
pages = {27}
}
@inproceedings{sal-sto-89-zzbuf
title = {The {ZZ}-Buffer: {A} Simple and Efficient Rendering Algorithm with reliable antialiasing},
author = {David Salesin and Jorge Stolfi},
booktitle = {Proc. the 2nd Annual Conference on Computer Graphics in Paris (PIXIM'89)},
pages = {451--466},
publisher = {Hermes},
address = {Paris (France)},
month = sep,
year = 1989
}
@phdthesis{sto-89-thesis
title = {Primitives for Computational Geometry},
author = {Jorge Stolfi},
school = {Stanford Univ., Department of Computer Science},
month = may,
year = 1988
}
@inproceedings{sal-gui-sto-89-eps
title = {Epsilon Geometry: {B}uilding Robust Algorithms from Imprecise Computations},
author = {Leonidas J. Guibas and David Salesin and Jorge Stolfi},
booktitle = {Proc. the 5th Annual Symposium on Com\-put\-atio\-nal Geometry (SOCG)Proceedings },
pages = {208--217},
month = jun,
year = 1989
}
@article{sha-sto-89-fra
title = {Two Methods for the Generation of Fractal Images},
author = {Jeffrey O. Shallit and Jorge Stolfi},
journal = {Computers \& Graphics (UK)},
volume = {13},
number = {2},
pages = {185--191},
month = mar,
year = 1989
}
@inproceedings{mai-sto-87-seg
title = {Reporting and Counting Line Segment Intersections},
author = {Harry Mairson and Jorge Stolfi},
booktitle = {Proc. the {NATO} Advanced Science Institute, Series F, vol.~40: Theoretical Foundations of Computer Graphics and {CAD}},
pages = {305--325},
publisher = {Springer-Verlag},
address = {Lucca (Italy)},
month = jul,
year = 1987
}
@inproceedings{gui-sto-87-geo
title = {Ruler, Compass and Computer: {T}he Design and Analysis of Geometric Algorithms},
note = {Invited paper},
author = {Leonidas J. Guibas and Jorge Stolfi},
booktitle = {Proc. the NATO Advanced Science Institute, series F, vol.~40: Theoretical Foundations of Computer Graphics and CAD},
pages = {111--165},
publisher = {Springer-Verlag},
address = {Lucca (Italy)},
month = jul,
year = 1987
}
@inproceedings{sto-87-opg
title = {Oriented Projective Geometry},
author = {Jorge Stolfi},
booktitle = {Proc. the 3rd Symposium on Computational Geometry (SOCG)},
arganization = {ACM},
address = {Waterloo (Canada)},
pages = {76--85},
month = jun,
year = 1987
}
@article{cla-gui-sto-87-lpl
title = {Solving Related Two- and Three-Dimensional Linear Programming Problems in Logarithmic Time},
author = {Kenneth L. Clarkson and Leonidas J. Guibas and Jorge Stolfi},
journal = {Theoretical Computer Science},
volume = {49},
pages = {81--84},
month = jan,
year = 1987
}
@article{ede-gui-sto-86-loc
title = {Optimal Point Location in a Monotone Subdivision},
author = {Herbert Edelsbrunner and Leonidas J. Guibas and Jorge Stolfi},
journal = {SIAM Journal on Computing},
volume = {15},
pages = {317--340},
month = may,
year = 1986
}
@article{gui-sto-85-quad
title = {Primitives for the Manipulations of General Subdivisions and the Computation of {Voronoi} Diagrams},
author = {Leonidas J. Guibas and Jorge Stolfi},
journal = {{ACM} Trans. on Graphics},
month = apr,
number = {2},
pages = {74--123},
volume = {4},
year = 1985
}
@article{bro-sto-84-pes
title = {Pessimal Algorithms and the Simplexity of Computations},
author = {Andrei Z. Broder and Jorge Stolfi},
journal = {ACM SIGACT News},
volume = {16},
number = {7},
pages = {49--53},
year = 1984
}
@inproceedings{gui-ram-sto-83-kin
title = {The Kinetic Framework for Computational Geometry},
author = {Leonidas J. Guibas and Lyle Ramshaw and Jorge Stolfi},
booktitle = {Proc. the 24th Annual Symposium on Foundations of Computer Science (FOCS)},
organization = {IEEE},
address = {Tucson, Arizona},
pages = {100--111},
month = nov,
year = 1983
}
@article{gui-sto-83-nen
title = {On Computing all {North}-{East} Neighbors in the {$L_1$} Metric},
author = {Leonidas J. Guibas and Jorge Stolfi},
journal = {Information Processing Letters},
volume = {17},
number = {4},
pages = {219--223},
month = nov,
year = 1983
}
@misc{gui-sto-83-notes
title = {Lecture Notes for CS445 Computational Geometry, Part II},
author = {Leonidas J. Guibas and Jorge Stolfi},
howpublished = {Stanford Univ., Department of Computer Science},
month = jan,
year = 1983
}
@article{gui-sto-82-bop
title = {A Language for Bitmap Manipulation},
author = {Leonidas J. Guibas and Jorge Stolfi},
journal = {ACM Trans. on Graphics},
volume = {1},
number = {3},
pages = {191--214},
month = jul,
year = 1982
}
@inproceedings{gui-sto-82-bop-sg
author = {Leo J. Guibas and Jorge Stolfi},
booktitle = {Proceedings of SIGGRAPH 82},
title = {A Language for Bitmap Manipulation},
incollection = {Computer Graphics},
volume = {16},
number = {3},
year = 1982,
month = jul,
pages = {311--311},
address = {Boston, Massachusetts.},
note = {Superseded by~[gui-sto-82-bop].}
}
@misc{gui-sto-82-notes
title = {Lecture Notes for CS445 Computational Geometry, part I},
author = {Leonidas J. Guibas and Jorge Stolfi},
howpublished = {Stanford Univ., Department of Computer Science},
month = jan,
year = 1982
}
@mastersthesis{sto-79-thesis
title = {M{\'e}todos Autom{\'a}ticos de Ger{\^e}ncia de Mem{\'o}ria},
author = {Jorge Stolfi},
school = {Departamento de Matem{\'a}tica Aplicada, IME, Universidade de S{\~a}o Paulo},
month = jul,
year = 1979
}
@inproceedings{sto-76-typ
title = {Considera{\c{c}}\~oes sobre Tipos em Linguagens de Alto N{\'\i}vel},
author = {Jorge Stolfi},
booktitle = {Anais do Simp{\'o}sio Internacional sobre Metodologias para o Projeto e Constru{\c{c}}{\~a}o de Sistemas de Hardware e Software},
address = {Pontif{\'\i}cia Universidade Cat{\'o}lica, Rio de Janeiro (Brazil)},
month = jul,
year = 1976
}
@techreport{set-kow-zwi-sto-74-alg
title = {Relat{\'o}rio preliminar sobre ALGOL-USP: Proposta de uma lin\-gua\-gem de programa{\c{c}}{\~a}o de uso geral},
institution = {Departamento de Matem{\'a}tica Aplicada, IME, Universidade de S{\~a}o Paulo},
author = {Valdemar W. Setzer and Tomasz Kowaltowski and Ronaldo Zwicker and Jorge Stolfi},
month = aug,
year = 1974
}