1Copyright, David M. Mount, 2010, Dept. of Computer Science, University of Maryland, College Park, MD, 20742. These lecture notes were prepared by David Mount for the course CMSC 754, Computational Geometry, at the University of Maryland. Permission to use, copy, modify, and distribute these notes for educational purposes and without fee is hereby granted, provided that this copyright notice ap...

From March 8 to March 13, 2009, the Dagstuhl Seminar 09111 Computational Geometry was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in th...

Background and Objectives: Pomegranate juice (PJ) contains large particles that stick to evaporator walls causing off flavors in the concentrate due to burning. Microfiltration is used to clarify PJ. Fouling is a limiting phenomenon that can prevent the industrialization of membrane clarification. Changes in the geometry of the membrane module such as using baffles are useful to decrease this p...

the crossing number of a graph  is the minimum number of edge crossings over all possible drawings of  in a plane. the crossing number is an important measure of the non-planarity of a graph, with applications in discrete and computational geometry and vlsi circuit design. in this paper we introduce vertex centered crossing number and study the same for maximal planar graph.

We prove a general lemma on the existence of (1/r)-cuttings of geometric objects in Ed that satisfy certain properties. We use this lemma to construct (1/r)-cuttings of small size for arrangements of line segments in the plane and arrangements of triangles in 3-space; for line segments in the plane we obtain a cutting of size O(r+Ar2/n2), and for triangles in 3-space our cutting has size O(r2+ε...

<p style='text-indent:20px;'>We present twelve numerical methods for evaluation of objects and concepts from Poisson geometry. We describe how each method works with examples, explain it is executed in code. These include that evaluate Hamiltonian modular vector fields, compute the image under coboundary trace operators, Lie bracket differential 1–forms, gauge transformations, normal form...

Introduction: The response variability between subjects, which is one of the fundamental challenges facing transcranial direct current stimulation (tDCS), can be investigated by understanding how the current is distributed through the brain. This understanding can be obtained by means of computational methods utilizing finite element (FE) models. Materials and Methods: In this study, the effect...