Well said. You can generate a surface data file with all 0s except your target vertex with mri_volsynth, something like:

mri_volsynth --vol yourfile.mgh --temp $SUBJECTS_DIR/yoursubject/surf/lh.curv --pdf delta --delta-crsf vertexno 0 0 0

you can smooth it with mri_surf2surf. You can get the number of vertices with mri_surfcluster

doug

Don Hagler wrote: 
It is easier to find the neighborhood for a given number of steps away from the vertex of interest.  One easy way is to set the value of a single vertex, smooth for a particular number of iterations, and then select the non-zero vertices.  If you smooth 5 times, you will get 5 steps away.  The number of vertices in that neighborhood will vary from vertex to vertex.


----------------------------------------
  
Date: Thu, 24 Jan 2008 16:02:14 -0500
From: nima@nmr.mgh.harvard.edu
To: freesurfer@nmr.mgh.harvard.edu
Subject: [Freesurfer] vertex neighbourhood

hi surfers,
Imagine that I need to know what are the closest N vertices (let's say
n=100) to a given vertex (i mean two dimentionsal neighourhood on
surfaces) . Any idea how to do that? anybody has a written code for this?
cheers
nima
_______________________________________________
Freesurfer mailing list
Freesurfer@nmr.mgh.harvard.edu
https://mail.nmr.mgh.harvard.edu/mailman/listinfo/freesurfer
    

_________________________________________________________________
Shed those extra pounds with MSN and The Biggest Loser!
http://biggestloser.msn.com/
_______________________________________________
Freesurfer mailing list
Freesurfer@nmr.mgh.harvard.edu
https://mail.nmr.mgh.harvard.edu/mailman/listinfo/freesurfer


  

-- 
Douglas N. Greve, Ph.D.
MGH-NMR Center
greve@nmr.mgh.harvard.edu
Phone Number: 617-724-2358 
Fax: 617-726-7422

In order to help us help you, please follow the steps in:
surfer.nmr.mgh.harvard.edu/fswiki/BugReporting