numpy - Animation of circles on python -

-

i trying circles appear 1 one in random locations on plot, interval of 1 second. if circles overlap, overlapping circles need added clusters , change colours depending on cluster belong to, or if touch left or right side of 'box'. new python , therefore struggling project. clusters need continue growing until there 5 circles in cluster. therefore, struggling create function continue create circles until condition met.

here code have written far

import numpy.random nr import scipy sp import pylab plt  import itertools matplotlib.animation import funcanimation  radius = 0.05 number_of_disks = 10 coordinates = nr.uniform(size=(number_of_disks, 2)) print coordinates  plt.close('all')     fig = plt.figure()    ax = plt.gca()  #plot of disks coordinate in coordinates:  ax.set_aspect('equal', adjustable='box')  circle = plt.circle((coordinate[0], coordinate[1]), radius, alpha = 0.4, color='b') ax.add_artist(circle)  plt.show()  disks = [] overlapping_disks = [] disks_at_edge = [] clusters = {}  def touch_sides(disk, radius):     row in range(0, number_of_disks):         x = coordinates[row, 0]         y = coordinates[row, 1]         left = true if x<= radius else false         right = true if x>=1-radius else false         disks.append({'x': x, 'y': y, 'left': left, 'right': right, 'cluster': 0})  def disk_overlap(disk, disk_after, radius):     disk, disk_after in itertools.combinations(coordinates,2):         if sp.sqrt(sp.power(disk[0]-disk_after[0],2)+sp.power(disk[1]-disk_after[1],2)) < 2*radius:             overlapping_disks.append((disk, disk_after))


Comments

Post a Comment

Popular posts from this blog

asp.net - How to correctly use QUERY_STRING in ISAPI rewrite? -

-
i'm having difficult time , hope guys can help. using helicon isapi rewrite version 3.1.0.104 on our iis server. edit http.conf file , have tried , still fail. this trying do: redirect url: https://www.domain.com/switch-by-version?version=2.8.5.2594 to: https://test.domain.com/load/load.aspx?tver=2.8.5.2594 the version number @ end source url change, , need target url have same version number @ end of url example above shows. i tried following not work: rewritecond %{query_string} ^version=(\d\d?)\.(\d\d?)\.(\d\d?)\.(.*)$ [nc] rewriterule ^/switch-by-version(.*)$ https://test.domain.com/load/load.aspx?tver=%1 [r=307,nc,l] any appreciated! thanks. if it's running in equivalent context of .htaccess , rule shouldn't start / . here's simpler version: rewritecond %{query_string} ^version=(\d+\.\d+\.\d+(?:\..+)?)$ [nc] rewriterule ^switch-by-version/?$ https://test.domain.com/load/load.aspx?tver=%1 [r=307,nc,l]
Read more

jsf - "PropertyNotWritableException: Illegal Syntax for Set Operation" error when setting value in bean -

-
this question has answer here: how send form input values , invoke method in jsf bean 1 answer i error when trying send values jsf page bean. i want set values fields in bean, create airplane instance , add database. error telling me use illegal syntax setter part of bean. why error? didnt find on site helped me problem. here jsf part: <h4>add plane</h4> <c:if test="#{not empty listairplanebb.error}"> <div class="alert alert-danger"> <span class="glyphicon glyphicon-remove"></span> <h:outputtext value="#{listairplanebb.error}" /> </div> </c:if> <h:form> <table class="table"> <thead> ...
Read more

arrays - Algorithm to find ideal starting spot in a circle -

-
so problem have been debating such: your given array of integers representing circle. then, have pick spot in circle start. place start, compare value @ array number of steps took there , if steps less or equal number, include in final set. find place start have elements in set. ex, a=[0, 1, 2] if start @ index=0, then: a[0]=0 < =0 0 included a[1]=1 < =1 1 included a[2]=2 < =2 2 included final set: {0,1,2} if start @ index=1, then: a[1]=1 > 0 1 not included a[2]=2 > 1 2 not included here loop around a[0]=0 > 2 0 included final set: {0} if start @ index=2, then: a[2]=2 > 0 2 not included, here loop around a[0]=0 < = 1 0 included a[1]=1 < = 2 1 included final set: {0,1} so in trivial case, starting position index=0 best position results in final set elements. brute force method of finding obvious, trying find more efficient method. attempts far have been examine trying find max intersect of viable starting ranges calculated each element in arr...
Read more