-
Notifications
You must be signed in to change notification settings - Fork 29
/
floor_objects.py
1696 lines (1492 loc) · 67.6 KB
/
floor_objects.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
import copy
import datetime
import json
import math
import multiprocessing
import random
import re
import time
import editdistance
import matplotlib.pyplot as plt
import numpy as np
from langchain import PromptTemplate, OpenAI
from rtree import index
from scipy.interpolate import interp1d
from shapely.geometry import Polygon, Point, box, LineString
import ai2holodeck.generation.prompts as prompts
from ai2holodeck.generation.milp_utils import *
from ai2holodeck.generation.objaverse_retriever import ObjathorRetriever
from ai2holodeck.generation.utils import get_bbox_dims
class FloorObjectGenerator:
def __init__(self, object_retriever: ObjathorRetriever, llm: OpenAI):
self.json_template = {
"assetId": None,
"id": None,
"kinematic": True,
"position": {},
"rotation": {},
"material": None,
"roomId": None,
}
self.llm = llm
self.object_retriever = object_retriever
self.database = object_retriever.database
self.constraint_prompt = PromptTemplate(
input_variables=["room_type", "room_size", "objects"],
template=prompts.object_constraints_prompt,
)
self.baseline_prompt = PromptTemplate(
input_variables=["room_type", "room_size", "objects"],
template=prompts.floor_baseline_prompt,
)
self.grid_density = 20
self.add_window = False
self.size_buffer = 10 # add 10 cm buffer to object size
self.constraint_type = "llm"
self.use_milp = False
self.multiprocessing = False
def generate_objects(self, scene, use_constraint=True):
rooms = scene["rooms"]
doors = scene["doors"]
windows = scene["windows"]
open_walls = scene["open_walls"]
selected_objects = scene["selected_objects"]
results = []
packed_args = [
(room, doors, windows, open_walls, selected_objects, use_constraint)
for room in rooms
]
if self.multiprocessing:
pool = multiprocessing.Pool(processes=4)
all_placements = pool.map(self.generate_objects_per_room, packed_args)
pool.close()
pool.join()
else:
all_placements = [
self.generate_objects_per_room(args) for args in packed_args
]
for placements in all_placements:
results += placements
return results
def generate_objects_per_room(self, args):
room, doors, windows, open_walls, selected_objects, use_constraint = args
selected_floor_objects = selected_objects[room["roomType"]]["floor"]
object_name2id = {
object_name: asset_id for object_name, asset_id in selected_floor_objects
}
room_id = room["id"]
room_type = room["roomType"]
room_x, room_z = self.get_room_size(room)
room_size = f"{room_x} cm x {room_z} cm"
grid_size = max(room_x // self.grid_density, room_z // self.grid_density)
object_names = list(object_name2id.keys())
if use_constraint:
# get constraints
constraint_prompt = self.constraint_prompt.format(
room_type=room_type,
room_size=room_size,
objects=", ".join(object_names),
)
if self.constraint_type == "llm":
constraint_plan = self.llm(constraint_prompt)
elif self.constraint_type in ["middle", "edge"]:
constraint_plan = ""
for object_name in object_names:
constraint_plan += f"{object_name} | {self.constraint_type}\n"
else:
print("Error: constraint type not supported!")
print(f"plan for {room_type}: {constraint_plan}")
constraints = self.parse_constraints(constraint_plan, object_names)
# get objects list
object2dimension = {
object_name: get_bbox_dims(self.database[object_id])
for object_name, object_id in object_name2id.items()
}
objects_list = [
(
object_name,
(
object2dimension[object_name]["x"] * 100 + self.size_buffer,
object2dimension[object_name]["z"] * 100 + self.size_buffer,
),
)
for object_name in constraints
]
# get initial state
room_vertices = [(x * 100, y * 100) for (x, y) in room["vertices"]]
room_poly = Polygon(room_vertices)
initial_state = self.get_door_window_placements(
doors, windows, room_vertices, open_walls, self.add_window
)
# solve
solver = DFS_Solver_Floor(
grid_size=grid_size, max_duration=30, constraint_bouns=1
)
solution = solver.get_solution(
room_poly,
objects_list,
constraints,
initial_state,
use_milp=self.use_milp,
)
placements = self.solution2placement(solution, object_name2id, room_id)
else:
object_information = ""
for object_name in object_names:
object_id = object_name2id[object_name]
dimension = get_bbox_dims(self.database[object_name2id[object_name]])
size_x = int(dimension["x"] * 100)
size_z = int(dimension["z"] * 100)
object_information += f"{object_name}: {size_x} cm x {size_z} cm\n"
baseline_prompt = self.baseline_prompt.format(
room_type=room_type,
room_size=room_size,
objects=", ".join(object_names),
)
room_origin = [
min(v[0] for v in room["vertices"]),
min(v[1] for v in room["vertices"]),
]
all_is_placed = False
while not all_is_placed:
completion_text = self.llm(baseline_prompt)
try:
completion_text = re.findall(
r"```(.*?)```", completion_text, re.DOTALL
)[0]
completion_text = re.sub(
r"^json", "", completion_text, flags=re.MULTILINE
)
all_data = json.loads(completion_text)
except json.JSONDecodeError:
continue
print(f"completion text for {room_type}: {completion_text}")
placements = list()
all_is_placed = True
for data in all_data:
object_name = data["object_name"]
try:
object_id = object_name2id[object_name]
except KeyError:
all_is_placed = False
break
dimension = get_bbox_dims(
self.database[object_name2id[object_name]]
)
placement = self.json_template.copy()
placement["id"] = f"{object_name} ({room_id})"
placement["object_name"] = object_name
placement["assetId"] = object_id
placement["roomId"] = room_id
placement["position"] = {
"x": room_origin[0] + (data["position"]["X"] / 100),
"y": dimension["y"] / 2,
"z": room_origin[1] + (data["position"]["Y"] / 100),
}
placement["rotation"] = {"x": 0, "y": data["rotation"], "z": 0}
placements.append(placement)
break # only one iteration
return placements
def get_door_window_placements(
self, doors, windows, room_vertices, open_walls, add_window=True
):
room_poly = Polygon(room_vertices)
door_window_placements = {}
i = 0
for door in doors:
door_boxes = door["doorBoxes"]
for door_box in door_boxes:
door_vertices = [(x * 100, z * 100) for (x, z) in door_box]
door_poly = Polygon(door_vertices)
door_center = door_poly.centroid
if room_poly.contains(door_center):
door_window_placements[f"door-{i}"] = (
(door_center.x, door_center.y),
0,
door_vertices,
1,
)
i += 1
if add_window:
for window in windows:
window_boxes = window["windowBoxes"]
for window_box in window_boxes:
window_vertices = [(x * 100, z * 100) for (x, z) in window_box]
window_poly = Polygon(window_vertices)
window_center = window_poly.centroid
if room_poly.contains(window_center):
door_window_placements[f"window-{i}"] = (
(window_center.x, window_center.y),
0,
window_vertices,
1,
)
i += 1
if open_walls != []:
for open_wall_box in open_walls["openWallBoxes"]:
open_wall_vertices = [(x * 100, z * 100) for (x, z) in open_wall_box]
open_wall_poly = Polygon(open_wall_vertices)
open_wall_center = open_wall_poly.centroid
if room_poly.contains(open_wall_center):
door_window_placements[f"open-{i}"] = (
(open_wall_center.x, open_wall_center.y),
0,
open_wall_vertices,
1,
)
i += 1
return door_window_placements
def get_room_size(self, room):
floor_polygon = room["floorPolygon"]
x_values = [point["x"] for point in floor_polygon]
z_values = [point["z"] for point in floor_polygon]
return (
int(max(x_values) - min(x_values)) * 100,
int(max(z_values) - min(z_values)) * 100,
)
def solution2placement(self, solutions, object_name2id, room_id):
placements = []
for object_name, solution in solutions.items():
if (
"door" in object_name
or "window" in object_name
or "open" in object_name
):
continue
dimension = get_bbox_dims(self.database[object_name2id[object_name]])
placement = self.json_template.copy()
placement["assetId"] = object_name2id[object_name]
placement["id"] = f"{object_name} ({room_id})"
placement["position"] = {
"x": solution[0][0] / 100,
"y": dimension["y"] / 2,
"z": solution[0][1] / 100,
}
placement["rotation"] = {"x": 0, "y": solution[1], "z": 0}
placement["roomId"] = room_id
placement["vertices"] = list(solution[2])
placement["object_name"] = object_name
placements.append(placement)
return placements
def parse_constraints(self, constraint_text, object_names):
constraint_name2type = {
"edge": "global",
"middle": "global",
"in front of": "relative",
"behind": "relative",
"left of": "relative",
"right of": "relative",
"side of": "relative",
"around": "relative",
"face to": "direction",
"face same as": "direction",
"aligned": "alignment",
"center alignment": "alignment",
"center aligned": "alignment",
"aligned center": "alignment",
"edge alignment": "alignment",
"near": "distance",
"far": "distance",
}
object2constraints = {}
plans = [plan.lower() for plan in constraint_text.split("\n") if "|" in plan]
for plan in plans:
# remove index
pattern = re.compile(r"^(\d+[\.\)]\s*|- )")
plan = pattern.sub("", plan)
if plan[-1] == ".":
plan = plan[:-1]
object_name = (
plan.split("|")[0].replace("*", "").strip()
) # remove * in object name
if object_name not in object_names:
continue
object2constraints[object_name] = []
constraints = plan.split("|")[1:]
for constraint in constraints:
constraint = constraint.strip()
constraint_name = constraint.split(",")[0].strip()
if constraint_name == "n/a":
continue
try:
constraint_type = constraint_name2type[constraint_name]
except:
_, new_constraint_name = min(
[
(editdistance.eval(cn, constraint_name), cn)
for cn in constraint_name2type
]
)
print(
f"constraint type {constraint_name} not found, using {new_constraint_name} instead."
)
constraint_name = new_constraint_name
constraint_type = constraint_name2type[constraint_name]
if constraint_type == "global":
object2constraints[object_name].append(
{"type": constraint_type, "constraint": constraint_name}
)
elif constraint_type in [
"relative",
"direction",
"alignment",
"distance",
]:
try:
target = constraint.split(",")[1].strip()
except:
print(f"wrong format of constraint: {constraint}")
continue
if target in object2constraints:
if constraint_name == "around":
object2constraints[object_name].append(
{
"type": "distance",
"constraint": "near",
"target": target,
}
)
object2constraints[object_name].append(
{
"type": "direction",
"constraint": "face to",
"target": target,
}
)
elif constraint_name == "in front of":
object2constraints[object_name].append(
{
"type": "relative",
"constraint": "in front of",
"target": target,
}
)
object2constraints[object_name].append(
{
"type": "alignment",
"constraint": "center aligned",
"target": target,
}
)
else:
object2constraints[object_name].append(
{
"type": constraint_type,
"constraint": constraint_name,
"target": target,
}
)
else:
print(
f"target object {target} not found in the existing constraint plan"
)
continue
else:
print(f"constraint type {constraint_type} not found")
continue
# clean the constraints
object2constraints_cleaned = {}
for object_name, constraints in object2constraints.items():
constraints_cleaned = []
constraint_types = []
for constraint in constraints:
if constraint["type"] not in constraint_types:
constraint_types.append(constraint["type"])
constraints_cleaned.append(constraint)
object2constraints_cleaned[object_name] = constraints_cleaned
return object2constraints
def order_objects_by_size(self, selected_floor_objects):
ordered_floor_objects = []
for object_name, asset_id in selected_floor_objects:
dimensions = get_bbox_dims(self.database[asset_id])
size = dimensions["x"] * dimensions["z"]
ordered_floor_objects.append([object_name, asset_id, size])
ordered_floor_objects.sort(key=lambda x: x[2], reverse=True)
ordered_floor_objects_no_size = [
[object_name, asset_id]
for object_name, asset_id, size in ordered_floor_objects
]
return ordered_floor_objects_no_size
class SolutionFound(Exception):
def __init__(self, solution):
self.solution = solution
class DFS_Solver_Floor:
def __init__(self, grid_size, random_seed=0, max_duration=5, constraint_bouns=0.2):
self.grid_size = grid_size
self.random_seed = random_seed
self.max_duration = max_duration # maximum allowed time in seconds
self.constraint_bouns = constraint_bouns
self.start_time = None
self.solutions = []
self.vistualize = False
# Define the functions in a dictionary to avoid if-else conditions
self.func_dict = {
"global": {"edge": self.place_edge},
"relative": self.place_relative,
"direction": self.place_face,
"alignment": self.place_alignment_center,
"distance": self.place_distance,
}
self.constraint_type2weight = {
"global": 1.0,
"relative": 0.5,
"direction": 0.5,
"alignment": 0.5,
"distance": 1.8,
}
self.edge_bouns = 0.0 # worth more than one constraint
def get_solution(
self, bounds, objects_list, constraints, initial_state, use_milp=False
):
self.start_time = time.time()
if use_milp:
# iterate through the constraints list
# for each constraint type "distance", add the same constraint to the target object
new_constraints = constraints.copy()
for object_name, object_constraints in constraints.items():
for constraint in object_constraints:
if constraint["type"] == "distance":
target_object_name = constraint["target"]
if target_object_name in constraints.keys():
# if there is already a distance constraint of target object_name, continue
if any(
constraint["type"] == "distance"
and constraint["target"] == object_name
for constraint in constraints[target_object_name]
):
continue
new_constraint = constraint.copy()
new_constraint["target"] = object_name
new_constraints[target_object_name].append(new_constraint)
# iterate through the constraints list
# for each constraint type "left of" or "right of", add the same constraint to the target object
# for object_name, object_constraints in constraints.items():
# for constraint in object_constraints: if constraint["type"] == "relative":
# if constraint["constraint"] == "left of":
constraints = new_constraints
try:
self.milp_dfs(bounds, objects_list, constraints, initial_state, 10)
except SolutionFound as e:
print(f"Time taken: {time.time() - self.start_time}")
else:
grid_points = self.create_grids(bounds)
grid_points = self.remove_points(grid_points, initial_state)
try:
self.dfs(
bounds, objects_list, constraints, grid_points, initial_state, 30
)
except SolutionFound as e:
print(f"Time taken: {time.time() - self.start_time}")
print(f"Number of solutions found: {len(self.solutions)}")
max_solution = self.get_max_solution(self.solutions)
if not use_milp and self.vistualize:
self.visualize_grid(bounds, grid_points, max_solution)
return max_solution
def get_max_solution(self, solutions):
path_weights = []
for solution in solutions:
path_weights.append(sum([obj[-1] for obj in solution.values()]))
max_index = np.argmax(path_weights)
return solutions[max_index]
def dfs(
self,
room_poly,
objects_list,
constraints,
grid_points,
placed_objects,
branch_factor,
):
if len(objects_list) == 0:
self.solutions.append(placed_objects)
return placed_objects
if time.time() - self.start_time > self.max_duration:
print(f"Time limit reached.")
raise SolutionFound(self.solutions)
object_name, object_dim = objects_list[0]
placements = self.get_possible_placements(
room_poly, object_dim, constraints[object_name], grid_points, placed_objects
)
if len(placements) == 0 and len(placed_objects) != 0:
self.solutions.append(placed_objects)
paths = []
if branch_factor > 1:
random.shuffle(placements) # shuffle the placements of the first object
for placement in placements[:branch_factor]:
placed_objects_updated = copy.deepcopy(placed_objects)
placed_objects_updated[object_name] = placement
grid_points_updated = self.remove_points(
grid_points, placed_objects_updated
)
sub_paths = self.dfs(
room_poly,
objects_list[1:],
constraints,
grid_points_updated,
placed_objects_updated,
1,
)
paths.extend(sub_paths)
return paths
def get_possible_placements(
self, room_poly, object_dim, constraints, grid_points, placed_objects
):
solutions = self.filter_collision(
placed_objects, self.get_all_solutions(room_poly, grid_points, object_dim)
)
solutions = self.filter_facing_wall(room_poly, solutions, object_dim)
edge_solutions = self.place_edge(
room_poly, copy.deepcopy(solutions), object_dim
)
if len(edge_solutions) == 0:
return edge_solutions
global_constraint = next(
(
constraint
for constraint in constraints
if constraint["type"] == "global"
),
None,
)
if global_constraint is None:
global_constraint = {"type": "global", "constraint": "edge"}
if global_constraint["constraint"] == "edge":
candidate_solutions = copy.deepcopy(
edge_solutions
) # edge is hard constraint
else:
if len(constraints) > 1:
candidate_solutions = (
solutions + edge_solutions
) # edge is soft constraint
else:
candidate_solutions = copy.deepcopy(solutions) # the first object
candidate_solutions = self.filter_collision(
placed_objects, candidate_solutions
) # filter again after global constraint
if candidate_solutions == []:
return candidate_solutions
random.shuffle(candidate_solutions)
placement2score = {
tuple(solution[:3]): solution[-1] for solution in candidate_solutions
}
# add a bias to edge solutions
for solution in candidate_solutions:
if solution in edge_solutions and len(constraints) >= 1:
placement2score[tuple(solution[:3])] += self.edge_bouns
for constraint in constraints:
if "target" not in constraint:
continue
func = self.func_dict.get(constraint["type"])
valid_solutions = func(
constraint["constraint"],
placed_objects[constraint["target"]],
candidate_solutions,
)
weight = self.constraint_type2weight[constraint["type"]]
if constraint["type"] == "distance":
for solution in valid_solutions:
bouns = solution[-1]
placement2score[tuple(solution[:3])] += bouns * weight
else:
for solution in valid_solutions:
placement2score[tuple(solution[:3])] += (
self.constraint_bouns * weight
)
# normalize the scores
for placement in placement2score:
placement2score[placement] /= max(len(constraints), 1)
sorted_placements = sorted(
placement2score, key=placement2score.get, reverse=True
)
sorted_solutions = [
list(placement) + [placement2score[placement]]
for placement in sorted_placements
]
return sorted_solutions
def create_grids(self, room_poly):
# get the min and max bounds of the room
min_x, min_z, max_x, max_z = room_poly.bounds
# create grid points
grid_points = []
for x in range(int(min_x), int(max_x), self.grid_size):
for y in range(int(min_z), int(max_z), self.grid_size):
point = Point(x, y)
if room_poly.contains(point):
grid_points.append((x, y))
return grid_points
def remove_points(self, grid_points, objects_dict):
# Create an r-tree index
idx = index.Index()
# Populate the index with bounding boxes of the objects
for i, (_, _, obj, _) in enumerate(objects_dict.values()):
idx.insert(i, Polygon(obj).bounds)
# Create Shapely Polygon objects only once
polygons = [Polygon(obj) for _, _, obj, _ in objects_dict.values()]
valid_points = []
for point in grid_points:
p = Point(point)
# Get a list of potential candidates
candidates = [polygons[i] for i in idx.intersection(p.bounds)]
# Check if point is in any of the candidate polygons
if not any(candidate.contains(p) for candidate in candidates):
valid_points.append(point)
return valid_points
def get_all_solutions(self, room_poly, grid_points, object_dim):
obj_length, obj_width = object_dim
obj_half_length, obj_half_width = obj_length / 2, obj_width / 2
rotation_adjustments = {
0: ((-obj_half_length, -obj_half_width), (obj_half_length, obj_half_width)),
90: (
(-obj_half_width, -obj_half_length),
(obj_half_width, obj_half_length),
),
180: (
(-obj_half_length, obj_half_width),
(obj_half_length, -obj_half_width),
),
270: (
(obj_half_width, -obj_half_length),
(-obj_half_width, obj_half_length),
),
}
solutions = []
for rotation in [0, 90, 180, 270]:
for point in grid_points:
center_x, center_y = point
lower_left_adjustment, upper_right_adjustment = rotation_adjustments[
rotation
]
lower_left = (
center_x + lower_left_adjustment[0],
center_y + lower_left_adjustment[1],
)
upper_right = (
center_x + upper_right_adjustment[0],
center_y + upper_right_adjustment[1],
)
obj_box = box(*lower_left, *upper_right)
if room_poly.contains(obj_box):
solutions.append(
[point, rotation, tuple(obj_box.exterior.coords[:]), 1]
)
return solutions
def filter_collision(self, objects_dict, solutions):
valid_solutions = []
object_polygons = [
Polygon(obj_coords) for _, _, obj_coords, _ in list(objects_dict.values())
]
for solution in solutions:
sol_obj_coords = solution[2]
sol_obj = Polygon(sol_obj_coords)
if not any(sol_obj.intersects(obj) for obj in object_polygons):
valid_solutions.append(solution)
return valid_solutions
def filter_facing_wall(self, room_poly, solutions, obj_dim):
valid_solutions = []
obj_width = obj_dim[1]
obj_half_width = obj_width / 2
front_center_adjustments = {
0: (0, obj_half_width),
90: (obj_half_width, 0),
180: (0, -obj_half_width),
270: (-obj_half_width, 0),
}
valid_solutions = []
for solution in solutions:
center_x, center_y = solution[0]
rotation = solution[1]
front_center_adjustment = front_center_adjustments[rotation]
front_center_x, front_center_y = (
center_x + front_center_adjustment[0],
center_y + front_center_adjustment[1],
)
front_center_distance = room_poly.boundary.distance(
Point(front_center_x, front_center_y)
)
if front_center_distance >= 30: # TODO: make this a parameter
valid_solutions.append(solution)
return valid_solutions
def place_edge(self, room_poly, solutions, obj_dim):
valid_solutions = []
obj_width = obj_dim[1]
obj_half_width = obj_width / 2
back_center_adjustments = {
0: (0, -obj_half_width),
90: (-obj_half_width, 0),
180: (0, obj_half_width),
270: (obj_half_width, 0),
}
for solution in solutions:
center_x, center_y = solution[0]
rotation = solution[1]
back_center_adjustment = back_center_adjustments[rotation]
back_center_x, back_center_y = (
center_x + back_center_adjustment[0],
center_y + back_center_adjustment[1],
)
back_center_distance = room_poly.boundary.distance(
Point(back_center_x, back_center_y)
)
center_distance = room_poly.boundary.distance(Point(center_x, center_y))
if (
back_center_distance <= self.grid_size
and back_center_distance < center_distance
):
solution[-1] += self.constraint_bouns
# valid_solutions.append(solution) # those are still valid solutions, but we need to move the object to the edge
# move the object to the edge
center2back_vector = np.array(
[back_center_x - center_x, back_center_y - center_y]
)
center2back_vector /= np.linalg.norm(center2back_vector)
offset = center2back_vector * (
back_center_distance + 4.5
) # add a small distance to avoid the object cross the wall
solution[0] = (center_x + offset[0], center_y + offset[1])
solution[2] = (
(solution[2][0][0] + offset[0], solution[2][0][1] + offset[1]),
(solution[2][1][0] + offset[0], solution[2][1][1] + offset[1]),
(solution[2][2][0] + offset[0], solution[2][2][1] + offset[1]),
(solution[2][3][0] + offset[0], solution[2][3][1] + offset[1]),
)
valid_solutions.append(solution)
return valid_solutions
def place_corner(self, room_poly, solutions, obj_dim):
obj_length, obj_width = obj_dim
obj_half_length, _ = obj_length / 2, obj_width / 2
rotation_center_adjustments = {
0: ((-obj_half_length, 0), (obj_half_length, 0)),
90: ((0, obj_half_length), (0, -obj_half_length)),
180: ((obj_half_length, 0), (-obj_half_length, 0)),
270: ((0, -obj_half_length), (0, obj_half_length)),
}
edge_solutions = self.place_edge(room_poly, solutions, obj_dim)
valid_solutions = []
for solution in edge_solutions:
(center_x, center_y), rotation = solution[:2]
(dx_left, dy_left), (dx_right, dy_right) = rotation_center_adjustments[
rotation
]
left_center_x, left_center_y = center_x + dx_left, center_y + dy_left
right_center_x, right_center_y = center_x + dx_right, center_y + dy_right
left_center_distance = room_poly.boundary.distance(
Point(left_center_x, left_center_y)
)
right_center_distance = room_poly.boundary.distance(
Point(right_center_x, right_center_y)
)
if min(left_center_distance, right_center_distance) < self.grid_size:
solution[-1] += self.constraint_bouns
valid_solutions.append(solution)
return valid_solutions
def place_relative(self, place_type, target_object, solutions):
valid_solutions = []
_, target_rotation, target_coords, _ = target_object
target_polygon = Polygon(target_coords)
min_x, min_y, max_x, max_y = target_polygon.bounds
mean_x = (min_x + max_x) / 2
mean_y = (min_y + max_y) / 2
comparison_dict = {
"left of": {
0: lambda sol_center: sol_center[0] < min_x
and min_y <= sol_center[1] <= max_y,
90: lambda sol_center: sol_center[1] > max_y
and min_x <= sol_center[0] <= max_x,
180: lambda sol_center: sol_center[0] > max_x
and min_y <= sol_center[1] <= max_y,
270: lambda sol_center: sol_center[1] < min_y
and min_x <= sol_center[0] <= max_x,
},
"right of": {
0: lambda sol_center: sol_center[0] > max_x
and min_y <= sol_center[1] <= max_y,
90: lambda sol_center: sol_center[1] < min_y
and min_x <= sol_center[0] <= max_x,
180: lambda sol_center: sol_center[0] < min_x
and min_y <= sol_center[1] <= max_y,
270: lambda sol_center: sol_center[1] > max_y
and min_x <= sol_center[0] <= max_x,
},
"in front of": {
0: lambda sol_center: sol_center[1] > max_y
and mean_x - self.grid_size
< sol_center[0]
< mean_x + self.grid_size, # in front of and centered
90: lambda sol_center: sol_center[0] > max_x
and mean_y - self.grid_size < sol_center[1] < mean_y + self.grid_size,
180: lambda sol_center: sol_center[1] < min_y
and mean_x - self.grid_size < sol_center[0] < mean_x + self.grid_size,
270: lambda sol_center: sol_center[0] < min_x
and mean_y - self.grid_size < sol_center[1] < mean_y + self.grid_size,
},
"behind": {
0: lambda sol_center: sol_center[1] < min_y
and min_x <= sol_center[0] <= max_x,
90: lambda sol_center: sol_center[0] < min_x
and min_y <= sol_center[1] <= max_y,
180: lambda sol_center: sol_center[1] > max_y
and min_x <= sol_center[0] <= max_x,
270: lambda sol_center: sol_center[0] > max_x
and min_y <= sol_center[1] <= max_y,
},
"side of": {
0: lambda sol_center: min_y <= sol_center[1] <= max_y,
90: lambda sol_center: min_x <= sol_center[0] <= max_x,
180: lambda sol_center: min_y <= sol_center[1] <= max_y,
270: lambda sol_center: min_x <= sol_center[0] <= max_x,
},
}
compare_func = comparison_dict.get(place_type).get(target_rotation)
for solution in solutions:
sol_center = solution[0]
if compare_func(sol_center):
solution[-1] += self.constraint_bouns
valid_solutions.append(solution)
return valid_solutions
def place_distance(self, distance_type, target_object, solutions):
target_coords = target_object[2]
target_poly = Polygon(target_coords)
distances = []
valid_solutions = []
for solution in solutions:
sol_coords = solution[2]
sol_poly = Polygon(sol_coords)
distance = target_poly.distance(sol_poly)
distances.append(distance)
solution[-1] = distance
valid_solutions.append(solution)
min_distance = min(distances)
max_distance = max(distances)
if distance_type == "near":
if min_distance < 80:
points = [(min_distance, 1), (80, 0), (max_distance, 0)]
else:
points = [(min_distance, 0), (max_distance, 0)]
elif distance_type == "far":
points = [(min_distance, 0), (max_distance, 1)]
x = [point[0] for point in points]