ipt: http://pastebin.com/prWLzEtk:
>
> _______
> postgis-users mailing list
> postgis-users@postgis.refractions.net
> http://postgis.refractions.net/mailman/listinfo/postgis-users
>
>
--
Carl Anderson, GISP
cander...@spatialfocus.com
carl.ander...@vadose.org
___
postgis-users mailing list
postgis-users@postgis.refractions.net
http://postgis.refractions.net/mailman/listinfo/postgis-users
Crawford
> Center for Environmental Informatics
> The Pennsylvania State universitysrc...@psu.edu
> 814.865.9905
>
>
> ___
> postgis-users mailing list
> postgis-users@postgis.refractions.net
> http://postgis.refractions.n
Have you considered subtracting a buffer around the boundary of each
polygon from itself. Kind of similar to st_buffer with a negative
distance but a good bit more stable.
st_difference(geom,st_buffer(st_boundary(geom),100))) from mypolytable ;
st_buffer(geom,-X) will work until X gets large
You don't need to build topology.
Have you tried something like:
select intersection(intersection (a.shape,b.shape),c.shape) , a.taxpin,
b.taxpin, c.taxpin
from tax.parcel a, tax.parcel b, tax.parcel c
where
a.taxpin != b.taxpin and
a.taxpin != b.taxpin and
st_dwithin(a.shape,b.shap
Charlie ,
neither of those polygons are valid
repeating points, self intersecting and the second one is not a closed
linestring
C.
Charlie Savage wrote:
This makes sense to me:
SELECT astext(GeomUnion(GeomFromText('POINT(-104 40)'),
GeomFromText('POINT(-105 40)')))
Paul Ramsey wrote:
Perhaps you could try some experiments for us :)
Write a PL/PgSQL function that takes in a linestring and returns a
tupleset of two (or four or eight) bounding boxes, that taken together
cover the linestring. By recursively dividing the master box into
smaller boxes that
