|
Jonathan Shewchuk
Professor in
Computer Science
Email is the best way to contact me. There's a chance you'll find me in my office afternoons or early evenings (typically 1–6 PM) on Mondays, Wednesdays, or Fridays during spring semesters. While you're by, ask me to make a pot of tea. I get teas from Upton Tea Imports, a first-rate importer in Massachusetts, and I enjoy introducing people to the good stuff. Mornings I sleep. During summers and fall semesters, I mostly work at home. Attempts to phone me then are futile. |
If you are considering applying for graduate school or a postdoctoral position in the Computer Science Division, please read this note.
STELLAR.
A C program for aggressively improving the quality of tetrahedral meshes,
making them suitable for finite element analysis.
Stellar routinely improves meshes so that the smallest dihedral angle is larger
than 30 degrees and the largest dihedral angle is smaller than 140 degrees.
See the
Stellar page
to obtain the source code, hypertext instructions, and
publications describing its algorithms.
STREAMING GEOMETRIC
SOFTWARE.
Software tools for processing huge meshes and point sets,
including Delaunay triangulation construction in two or three dimensions
and computations for GIS (Geographic Information Systems).
Need to triangulate billions of points, or use them
to construct elevation maps and isocontours, on an ordinary computer?
Martin Isenburg, I, and our collaborators have streaming tools for
constructing huge Delaunay triangulations,
constructing Digital Elevation Maps and isolines,
processing LIDAR data in LAS format, and
visualizing LIDAR data in Google Earth.
Our algorithms for processing gobs of data are discussed in several papers on
my Papers
page.
EXACT ARITHMETIC AND ROBUST
GEOMETRIC PREDICATES.
I've written a set of fast routines for exact floating-point
addition and multiplication, which I've used to create
fast correct geometric predicates, namely the two- and three-dimensional
orientation and incircle tests.
These predicates are used to make the Delaunay triangulation routines
in Triangle and Star robust against roundoff error.
See my
Robust Predicates page for more information, for papers,
or to obtain the C source code.
RESEARCH OVERVIEW.
Here's a self-contained summary of some of my research.
This is the fastest way to learn a bit about my work.
THREE SINS OF AUTHORS IN
COMPUTER SCIENCE AND MATH.
A short crotchety essay that will improve your technical writing,
or annoy you trying.
You won't find these sins decried in the usual books of writing advice.
While you're at it, you might be interested in my (less snarky) advice on
Giving an Academic
Talk.
CS 274: COMPUTATIONAL GEOMETRY
(Spring 2019,
Spring 2017,
Spring 2015,
Spring 2013,
Autumn 2009,
Autumn 2006,
Spring 2005,
Spring 2003).
Geometric algorithms, analyses, and applications.
Polygons, polytopes, triangulations, planar and spatial subdivisions,
convex hulls, halfspace intersections, Voronoi diagrams,
Delaunay triangulations, arrangements of lines and hyperplanes.
Geometric queries (databases, point location), binary space partitions,
robot motion planning, cartography, solid modeling,
small-dimensional linear programming, and more.
CS 189 / CS 289A: INTRODUCTION TO MACHINE
LEARNING
(Spring 2025,
Spring 2024,
Spring 2023,
Spring 2022,
Spring 2021,
Spring 2020,
Spring 2019,
Spring 2017,
Spring 2016).
The study of how computers can “learn”
by finding patterns in data and using them to make predictions.
Covers supervised learning methods such as classification and regression, and
unsupervised learning methods such as clustering, dimensionality reduction, and
density estimation.
CS 170: EFFICIENT ALGORITHMS AND
INTRACTABLE PROBLEMS (Spring 2001).
The study of advanced algorithms, including graph algorithms,
dynamic programming, linear programming, matrix multiplication,
and number theory, plus an introduction to the theory of
NP-completeness.
CS 61B: DATA STRUCTURES
(Spring 2014,
Spring 2013,
Spring 2012,
Autumn 2010,
Spring 2009,
Autumn 2006,
Spring 2005,
Spring 2004,
Spring 2002,
Spring 2000,
Autumn 1998).
An introduction to data structures (lists, trees, hash tables, graphs, etc.),
simple algorithms (searching and sorting), encapsulation,
and the language Java.
CS 4 aka CS 39L: INTRODUCTION TO COMPUTING FOR
ENGINEERS (Spring 2006).
An introductory computer programming class that employs
examples from engineering and science.
An alternative to CS 3, taught in the language Java.
MARC KHOURY in May 2020 completed his Ph.D. on restricted constrained Delaunay triangulations and the geometry of adversarial examples. Read his dissertation, Geometric Sampling Theory, Triangulations, and Robust Machine Learning. He now works at Hudson River Trading.
BRYAN KLINGNER
in November 2008 completed his Ph.D. on
tetrahedral
mesh improvement algorithms and
physical simulations with dynamically changing geometry.
Read his dissertation,
Improving
Tetrahedral Meshes.
He now works at Google.
RAVIKRISHNA KOLLURI
in December 2005 completed his Ph.D. on surface reconstruction algorithms,
including
spectral
surface reconstruction, scan registration,
moving least squares interpolation for generating implicit surfaces
(which won the Best Student Paper Award
at the 2005 Symposium on Discrete Algorithms),
and the very cool
power
crust.
Read his dissertation,
From
Range Images to 3D Models.
He now works at Google.
FRANÇOIS LABELLE
in August 2007 completed his Ph.D. on
tetrahedral mesh generation algorithms with
guaranteed dihedral angles (notably
isosurface
stuffing).
Read his dissertation,
Tetrahedral
Mesh Generation with Good Dihedral Angles Using Point Lattices.
During his time at Berkeley,
he also did lovely work in
anisotropic
mesh generation.
JESSICA SCHOEN
in May 2008 completed her M.S. on
robust anisotropic mesh generation in the plane.
Read her thesis,
Robust,
Guaranteed-Quality Anisotropic Mesh Generation.
CALVIN AND HOBBES AND
CARNEGIE MELLON UNIVERSITY'S
SCHOOL OF COMPUTER SCIENCE.
My t-shirt design for the 1994 Immigration Course.
For printing, here's the
full-size version (3553 x 5861, 621k GIF),
which is also a 600 dpi scan of a sheet of legal-size paper.
I WAS BORN in
Cranbrook, British Columbia, Canada.
I am a Canadian citizen and a U.S. permanent resident.
I obtained my B.Sc. in
Physics and
Computing Science from
Simon Fraser University in 1990,
and my M.S. and Ph.D. in
Computer Science from
Carnegie Mellon University,
the latter in 1997.
I am trained to only sleep during
national holidays.
I joined the
Computer Science Division of the
Department of Electrical Engineering and Computer Sciences at
Berkeley in 1998.
I am also an Adjunct Semi-Senior Pseudoscientist with
Enhanced Library Privileges in the School of Information Repetition at
Stanford–Berkeley Professors' Spouses'
University.
My favorite piano concertos are
Brahms' Second,
Medtner's Third,
and Scharwenka's
Fourth.
Only I am allowed to talk about Fight Club.
DR. MALCOLM KENDRICK'S
INFORMATIVE AND HILARIOUS 2021 BOOK
The Clot Thickens
is a fascinating review of the biology of atherosclerosis and heart disease.
But I most want to share not the part of his book about
the etiology of heart disease, but rather the part discussing
which lifestyle changes have the greatest effect on lifespan,
based on our present knowledge.
Dr. Kendrick writes, “Despite the fact that it is very rarely done,
it is possible to convert a percentage risk into the common currency of
life expectancy.”
You would think that researchers would do this more often, and
doctors would inform their patients of how many expected months
this or that pill or surgery will add to your life.
But Dr. Kendrick says, “I don't think I have ever seen
anyone else do this, or even attempt to do this?
Possibly because it is just so damned tricky. …
“Doctor: ‘Oh my God you have a 10.3% risk of a cardiovascular event.’
“Patient: ‘Which means… what? Tell me please doctor. Tell me. I must know.’
“Doctor: ‘It means you have a 10.3% risk of a cardiovascular event—so you must take a statin every day for the rest of your life. Here is your prescription. Next!’ ”
Dr. Kendrick's estimates of how much the interventions discussed below extend lifespan on average involve some guesswork (and depend on the age at which the intervention is begun), but we can be reasonably confident that these interventions have significant positive health effects for the average person. Observe that this list has little in common with what most people would expect to be on the list—overrated interventions like statin drugs, eating less saturated fat, and losing weight. Dr. Kendrick estimates you might gain “Three days extra for every five years taking the statin.” Here are some of his more optimistic estimates.
The to-do list should probably include magnesium supplementation, and the don't-do list should surely include corticosteroids, but I don't have mortality estimates for those. The don't-do list should also include polypharmacy: the average American over 80 takes 22 medications regularly, and a trial that carefully discontinued some medications in geriatric nursing departments reduced the one-year mortality from 45% to 21%.
Another result from the Scottish Heart Health study is particularly noteworthy. Among blood markers, the most predictive of mortality was excess serum fibrinogen. Fibrinogen is a clotting factor, and too much of it seems to increase the rate of strokes and cardiovascular disease. Unfortunately, we don't know much about how to reduce serum fibrinogen. Contrary to what you might expect, there was not a clear relationship between cholesterol and mortality. High total cholesterol and low HDL cholesterol appear to be predictive of death by cardiovascular heart disease, but deaths by other causes are reduced enough to compensate!
“In my psychedelic, hazy-vision state, where I reach the ultimate
heightened awareness of the beer-buzz, I realise the true meaning of exams:
that professors are evil, torture-loving beings, and that we cannot blame them
for their shortcomings.”
—
Rob Chung
“We need a more lasting form of negative feedback than just
paper rejections.”
— Jonathan Hardwick