Handout 1
EE124: Introduction to Neuroelectrical Engineering
EE124, Shenoy
What is Neuroelectrical Engineering?
The field is extremely young, vibrant, growing and is still being defined.
So dont think that a clear definition really even exists yet!
But
Computational Geometry: Homework 7 Solution
Yifei Chen
Department of Computer Sciences
University of California, Irvine
[email protected]
10.1
The scheme of this problem is depicted as follows:
Build a 1-dim range tree on y-coordinate; O(n) storage, O(nlogn)
Solution for Homework 4
4.1
No unique answers. A possible one may be:
z
x
y
In each direction above, the object has a cylinder and a cone frustum joint together.
4.2
Given polygon P with n edges (facet), its mold would contain n-1 ordinary edges (facets)
Lecture 3: Intro Continued & Ion Channels
Reading assignment from Kandell, Schwartz & Jessell:
Chapter 6 Ion Channels
Lecture 2 left off having introduced neurons and action potentials.
Lecture 3 will complete our introduction to the nervous system.
Lecture 6: Propagated Signals Action Potentials
Reading assignment from Kandell, Schwartz & Jessell:
Chapter 9 Propagated Signaling: The Action Potential
Neurons can carry information long distances b/c of action potentials.
Action potentials (APs or
Lecture 5: Passive Electrical Properties
Reading assignment from Kandell, Schwartz & Jessell:
Chapter 8 Local Signaling: Passive Electrical Properties
of the Neuron
We are now equipped to calculate Vm for any set of:
ionic concentration gradients and
Solution for Homework 3
3.1
(1) To perform triangulation, the first step is to partition it into monotone polygons with respect to a
certain direction, y-axis, for example. In this step, we can sort the event points and treat them as
start, end, split, me
Final 250 points
600.488 Computational Geometry
May 12, 1999
1. Please dene each of the following terms:
(a) distance metric
(b) Delaunay triangulation
(c) visibility between two points
2. 3-D Convex Hulls.
(a) Why does a convex polyhedron with n vertices
Computational Geometry: Homework 6 Solution
Yifei Chen
Department of Computer Sciences
University of California, Irvine
[email protected]
1.
We first compute the Voronoi diagram of point set B (V.D.(B), and get a subdivision of the plane with
O(n) complexity
Midterm Exam 150 points Computational Geometry March 12, 1997
1. 30 points. Dene each of the following terms (using at most 2 sentences each):
(a) convex hull,
(b) planar subdivision,
(c) trapezoidal decomposition.
2. 30 points. Describe an ecient method
Midterm Exam 150 points Computational Geometry April 9, 1996
1. 30 points. Dene each of the following terms (using at most 2 sentences each):
(a) star-shaped polygon,
(b) Delaunay triangulation,
(c) line arrangement.
2. 30 points.
(a) Draw, as best you ca
Midterm Exam 150 points Computational Geometry March 15, 1995
1. 30 points. Dene each of the following terms (using at most 2 sentences each):
(a) convex hull of a set of points,
(b) Voronoi diagram,
(c) point location data structure.
2. 30 points.
(a) Dr
Final 250 points
600.488 Computational Geometry
May 17, 1995
1. Please dene each of the following terms:
(a) line arrangement
(b) convex hull
(c) -net
(d) upper envelope
(e) Delaunay triangulation
2. Draw, as best you can, the arrangement of the following
Final 250 points
600.488 Computational Geometry
May 7, 1997
1. Please dene each of the following terms using one or two sentences:
(a) ham-sandwich cut
(b) trapezoidal decomposition
(c) the 2-dimensional linear programming problem
2. Delaunay triangulatio
Solution for Homework 1
1.1
(a) Given two convex set S1, S2, their intersection is S = S1 S 2 ;
For any points p, q S , we have: pq S1 and pq S 2 , so pq S1 S 2
Thus S is convex.
(b) Proof by contradiction. Suppose the smallest perimeter polygon containin
Final 250 points
600.488 Computational Geometry
May 12, 1998
1. Please dene each of the following terms using one or two sentences:
(a) polygon triangulation
(b) lower envelope of a set of functions
(c) Voronoi diagram
2. 3-D Convex Hull
(a) Draw, as best
A brief solution plan for HW2
2.1
Since the n segments are disjoint, we can sort them in a BST by the x-coordinates of either their upper
endpoints, or their lower endpoints. This takes O ( n log n ) time.
To determine between which two segments the query
Solution for Homework 5 of Computational Geometry
5.10
(a) We can do some extra work when building up the range tree. That is, for each node in the binary
search tree, record the number of descendents including the node itself. This operation happens once
Midterm Exam 150 points Computational Geometry March 10, 1998
1. 30 points. Dene each of the following terms (using at most 2 sentences each):
(a) polygon triangulation,
(b) convex hull,
(c) simple polygon.
2. 30 points. Describe an ecient plane-sweeping