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 thi
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
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 (face
Lecture 4: Membrane Potential
Reading assignment from Kandell, Schwartz & Jessell:
Chapter 7 Membrane Potential
Information carried within & between neurons w/ electrical & chemical
signals.
Trans
Lecture 2: Introduction to Neuroscience
Reading assignment from Kandell, Schwartz & Jessell:
Chapter 1 The brain and behavior
Chapter 2 Nerve cells and behavior
Neural science (neuroscience) under
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
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
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 t
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
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),
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
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) l
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,
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.
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-dimensio
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 contradi
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
(
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 )
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
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 po